Soft set theory has a rich potential application in several fields. A soft group is a parameterized family of subgroups and a fuzzy soft group is a parameterized family of fuzzy subgroups. The concept of fuzzy soft gr...Soft set theory has a rich potential application in several fields. A soft group is a parameterized family of subgroups and a fuzzy soft group is a parameterized family of fuzzy subgroups. The concept of fuzzy soft group is the generalization of soft group. Abdulkadir Aygunoglu and Halis Aygun introduced the notion of fuzzy soft groups in 2009[1]. In this paper, the concept of lattice ordered fuzzy soft groups and its duality has been introduced. Then distributive and modular lattice ordered fuzzy soft groups are analysed. The objective of this paper is to study the lattice theory over the collection of fuzzy soft group in a parametric manner. Some pertinent properties have been analysed and hence established duality principle.展开更多
The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, ...The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.展开更多
In this paper, which is a continuation of our previous paper [T. Albu, M. Iosif, A. Tercan, The conditions （Ci） in modular lattices, and applications, J. Algebra Appl. 15 （2016）, http： dx.doi.org/10.1142/S0219498...In this paper, which is a continuation of our previous paper [T. Albu, M. Iosif, A. Tercan, The conditions （Ci） in modular lattices, and applications, J. Algebra Appl. 15 （2016）, http： dx.doi.org/10.1142/S0219498816500018], we investigate the latticial counterparts of some results about modules satisfying the conditions （Cll） or （C12）. Applications are given to Grothendieck categories and module categories equipped with hereditary torsion theories.展开更多
It is well known that almost all subset sum problems with density less than 0.9408… can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice.In this paper,the authors s...It is well known that almost all subset sum problems with density less than 0.9408… can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice.In this paper,the authors show that a similar result holds for the k-multiple subset sum problem which has k subset sum problems with exactly the same solution.Specially,for the single subset sum problem(k=1),a modified lattice is introduced to make the proposed analysis much simpler and the bound for the success probability tighter than before.Moreover,some extended versions of the multiple subset sum problem are also considered.展开更多
文摘Soft set theory has a rich potential application in several fields. A soft group is a parameterized family of subgroups and a fuzzy soft group is a parameterized family of fuzzy subgroups. The concept of fuzzy soft group is the generalization of soft group. Abdulkadir Aygunoglu and Halis Aygun introduced the notion of fuzzy soft groups in 2009[1]. In this paper, the concept of lattice ordered fuzzy soft groups and its duality has been introduced. Then distributive and modular lattice ordered fuzzy soft groups are analysed. The objective of this paper is to study the lattice theory over the collection of fuzzy soft group in a parametric manner. Some pertinent properties have been analysed and hence established duality principle.
文摘The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.
文摘In this paper, which is a continuation of our previous paper [T. Albu, M. Iosif, A. Tercan, The conditions （Ci） in modular lattices, and applications, J. Algebra Appl. 15 （2016）, http： dx.doi.org/10.1142/S0219498816500018], we investigate the latticial counterparts of some results about modules satisfying the conditions （Cll） or （C12）. Applications are given to Grothendieck categories and module categories equipped with hereditary torsion theories.
基金supported by the National Natural Science Foundation of China under Grant Nos.11201458,11471314in part by 973 Project under Grant No.2011CB302401in part by the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences
文摘It is well known that almost all subset sum problems with density less than 0.9408… can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice.In this paper,the authors show that a similar result holds for the k-multiple subset sum problem which has k subset sum problems with exactly the same solution.Specially,for the single subset sum problem(k=1),a modified lattice is introduced to make the proposed analysis much simpler and the bound for the success probability tighter than before.Moreover,some extended versions of the multiple subset sum problem are also considered.
