Results 161 to 170 of about 434,852 (214)
Some of the next articles are maybe not open access.
A generalization of the ElGamal public-key cryptosystem
IACR Cryptology ePrint Archive, 2021The ElGamal cryptosystem is one of the most widely used public-key cryptosystems that depends on the difficulty of computing the discrete logarithms over finite fields. Over the years, the original system has been modified and altered in order to achieve
Raj Ranasinghe, Pabasara Athukorala
semanticscholar +1 more source
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2020
Herein, an asymmetric image encryption algorithm based on RSA cryptosystem and a fractional-order chaotic system is proposed. Its security depends on RSA algorithm. First, a pair of public and private keys is generated by RSA algorithm.
G. Ye +4 more
semanticscholar +1 more source
Herein, an asymmetric image encryption algorithm based on RSA cryptosystem and a fractional-order chaotic system is proposed. Its security depends on RSA algorithm. First, a pair of public and private keys is generated by RSA algorithm.
G. Ye +4 more
semanticscholar +1 more source
Quantum Public-Key Cryptosystem
International Journal of Theoretical Physics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luo, Ming-Xing +3 more
openaire +1 more source
Lattice-Based Public Key Cryptosystem for Internet of Things Environment: Challenges and Solutions
IEEE Internet of Things Journal, 2019Due to its widespread popularity and usage in many applications (smart transport, energy management, ${e}$ -healthcare, smart ecosystem, and so on), the Internet of Things (IoT) has become popular among end users over the last few years. However, with an
Rajat Chaudhary +3 more
semanticscholar +1 more source
A public key cryptosystem using Affine Hill Cipher under modulation of prime number
Journal of Information and Optimization Sciences, 2019M.K. Viswanath in [1] proposed the concepts a public key cryptosystem using Hill’s Cipher. This paper develops a public key cryptosystem using Affine Hill Cipher.
P. Sundarayya, N. Raju, M. Prasad
semanticscholar +1 more source
Complexity Measures for Public-Key Cryptosystems
SIAM Journal on Computing, 1988A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and these approaches correspond to different but equivalent formulations of the problem of cracking a public-key cryptosystem (PKCS).
Grollmann, Joachim, Selman, Alan L.
openaire +2 more sources
Coalition Public-Key Cryptosystems
Cybernetics and Systems Analysis, 2001A coalition is understood to be a group of participants (coalitionists) who can collaborate in order to achieve common objectives. The basic principle of a coalition is the absence of a threat to communication flows within the coalition from its participants. In this paper, two new RSA coalition protocols are considered. According to the first protocol,
openaire +1 more source
Stateful public-key cryptosystems
Proceedings of the 13th ACM conference on Computer and communications security, 2006We show how to significantly speed-up the encryption portion of some public-key cryptosystems by the simple expedient of allowing a sender to maintain state that is re-used across different encryptions.In particular we present stateful versions of the DHIES and Kurosawa-Desmedt schemes that each use only 1 exponentiation to encrypt, as opposed to 2 and
Mihir Bellare +2 more
openaire +1 more source
2003
In 1976 Diffie and Hellman [152] described the framework for public-key cryptography. It was not until 1978 that three designs for public-key cryptosystems were published. Rivest, Shamir, and Adleman [431] showed how the discrete logarithm and factorization problems could be used to construct a public-key cryptosystem.
Josef Pieprzyk +2 more
openaire +1 more source
In 1976 Diffie and Hellman [152] described the framework for public-key cryptography. It was not until 1978 that three designs for public-key cryptosystems were published. Rivest, Shamir, and Adleman [431] showed how the discrete logarithm and factorization problems could be used to construct a public-key cryptosystem.
Josef Pieprzyk +2 more
openaire +1 more source