Results 141 to 150 of about 19,193 (189)
Some of the next articles are maybe not open access.
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
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
Vulnerable Public Keys in NTRU Cryptosystem
Chinese Annals of Mathematics, Series B, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Liqing +3 more
openaire +2 more sources
International Journal of Systems Science, 1990
Abstract The development of a new public-key cryptosystem is discussed. This system is a hybrid combination of the RSA (Rivest-Shamir-Adleman) and knapsack crypto-systems. The message is encrypted in two stages using the knapsack algorithm followed by the RSA algorithm, and then decrypted in reverse order.
SAAD M. KALlPHA +2 more
openaire +1 more source
Abstract The development of a new public-key cryptosystem is discussed. This system is a hybrid combination of the RSA (Rivest-Shamir-Adleman) and knapsack crypto-systems. The message is encrypted in two stages using the knapsack algorithm followed by the RSA algorithm, and then decrypted in reverse order.
SAAD M. KALlPHA +2 more
openaire +1 more source
Quaternion public key cryptosystems
2016 World Congress on Industrial Control Systems Security (WCICSS), 2016In this paper, quaternion key exchange protocol and quaternion public key encryption scheme are proposed. The security of proposals relies on hardness of the hidden quaternion conjugacy search problem, that is, difficulty of solving the simultaneous quaternion discrete logarithmic problem and quaternion conjugacy search problem over quaternion rings ...
Maheswara Rao Valluri +1 more
openaire +1 more source
A Survey of Public-Key Cryptosystems
SIAM Review, 2004The authors not only provide an overview of the best public-key ciphers, but also show how difficult a task it is to rank such cryptosystems. Their list of references is extensive with 124 items for further reading. Anyone interested in this topic should have a look at this paper.
Koblitz, Neal, Menezes, Alfred J.
openaire +2 more sources
1986
It was only recently that public key cryptography developed into a precise mathematical subject, mainly as a response to the growing need for secure transmission of information via the electronic media. The main new idea was to base the security of cryptosystems on the intractability of number theory problems.
openaire +1 more source
It was only recently that public key cryptography developed into a precise mathematical subject, mainly as a response to the growing need for secure transmission of information via the electronic media. The main new idea was to base the security of cryptosystems on the intractability of number theory problems.
openaire +1 more source
Public-key ID-based cryptosystem
Proceedings. 25th Annual 1991 IEEE International Carnahan Conference on Security Technology, 2002It is shown how a chosen-public-key attack can compromise the ID-based cryptosystem of S. Tsujii and T. Itoh (1989), as well as most of the existing public-key cryptosystems. The authors present a scheme which can withstand the chosen-public-key attack, based on the concept of an cryptosystem.
H.-M. Sun, T. Hwang
openaire +1 more source