Results 181 to 190 of about 5,578 (218)
Some of the next articles are maybe not open access.
A New Knapsack Public-Key Cryptosystem
2009 Fifth International Conference on Information Assurance and Security, 2009A new knapsack-type public key cryptosystem is proposed by constructing an easy knapsack problem. The cryptosystem is shown to be secure against Shamir's key-recovery attack in that it does not use a super-increasing knapsack sequence in the construction process.
Weidong Zhang, Baocang Wang, Yupu Hu
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
Cryptanalysis of a Knapsack Public Key Cryptosystem
2009 Fifth International Conference on Information Assurance and Security, 2009Murakami and Nasako proposed a knapsack public key cryptosystem in2008. They claimed that their proposal is secure against some known attacks. In this paper, we propose a cryptanalytic attack on the cryptosystem. We use a heuristic method to show that the secret key can be recovered with lattice reduction algorithms.
Baocang Wang, Hui Liu, Yupu Hu
openaire +1 more source
A Hash-Based Public Key Cryptosystem
2018In this paper, a new public key cryptosystem based on hash is proposed. The algorithm uses hash and time-memory trade-off to construct a trap-door one-way function. It can guarantee the security strength equivalent to the same length symmetric encryption algorithm.
Qian Yin, Gang Luo
openaire +1 more source
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
A note on the mathematics of public-key cryptosystems
Computers & Security, 1984Abstract This note presents several new number-theoretic results with theoretical connections to the area of so-called RSA public-key cryptosystems. Indeed, the results have an independent mathematical interest of their own. No claim is made concerning the practicality of the results for support in breaking RSA cryptosystems.
openaire +1 more source
A generalization of the ElGamal public-key cryptosystem
Journal of Discrete Mathematical Sciences and Cryptography, 2021Rajitha Ranasinghe, Pabasara Athukorala
openaire +2 more sources
The design and operation of public-key cryptosystems
1979 International Workshop on Managing Requirements Knowledge (MARK), 1979Recently, there has been a major advance in the area of communications security—that of a practical way to implement public-key cryptosystems (PKCS).
openaire +1 more source