Results 91 to 100 of about 11,187 (236)
Homomorphic public-key cryptosystems over groups and rings [PDF]
arXiv, 2003 We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity finite group based on the difficulty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the first time over finite commutative rings.
arxiv
BF‐ACS—Intelligent and Immutable Face Recognition Access Control System
IET Information Security, Volume 2025, Issue 1, 2025.Biometric authentication is adopted in many access control scenarios in recent years. It is very convenient and secure since it compares the user’s own biometrics with those stored in the database to confirm their identification. Since then, with the vigorous development of machine learning, the performance and accuracy of biometric authentication have
Wen-Bin Hsieh, Wanli Wen
wiley +1 more source
Considerations for rank-based cryptosystems
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Cryptosystems based on rank metric codes have been considered as an alternative to McEliece cryptosystems due to the relative difficulty of solving the rank syndrome decoding problem. Generic attacks have recently seen several improvements, notably in the work of Gaborit et al., who give an improved algorithm using linearized polynomials which yields a
Horlemann-Trautmann Anna-Lena +2 more
openaire +5 more sources
IEEE Access, 2018 Recently, color image encryption has attracted extensive research interests. However, challenging issues, such as linearity, complex-valued output, and information disclosure, remain.
Jun Wang, Qiong-Hua Wang, Yuhen Hu
doaj +1 more source
Hidden Polynomial(s) Cryptosystems
, 2003 We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can be replaced by a ``small'' ideal, as well. Throughout, we set up probabilistic encryption protocols, too. The same
openaire +3 more sources
Asymmetric Cryptosystem Using Improved Equal Modulus Decomposition in Cylindrical Diffraction Domain
IEEE Access, 2019 We present a simple and efficient asymmetric cryptosystem using an improved equal modulus decomposition (EMD) in the cylindrical diffraction domain. Being different from a cryptosystem based on the conventional EMD, whose outputs are complex-valued, in ...
Jun Wang +4 more
doaj +1 more source
Public-key cryptography and invariant theory [PDF]
arXiv, 2002 Public-key cryptosystems are suggested based on invariants of groups. We give also an overview of the known cryptosystems which involve groups.
arxiv
Bulletin of Electrical Engineering and Informatics, 2015 This paper, we introduce mainly the concept of beta cryptosystem, whose security is based on generalized discrete logarithm problem and integer factorization problem in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on generalized discrete logarithm problem and integer factorization problem, provides ...
openaire +3 more sources
arXiv, 2020 ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers. The authors claimed that ITRU has better features comparing to the classical NTRU, such as having a simple parameter selection algorithm, invertibility,
arxiv
Advances in Homomorphic Cryptosystems
, 2009 JUCS - Journal of Universal Computer Science Volume Nr.
openaire +2 more sources