140 search results - page 20 / 28 » Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi... |
WCC
2005
Springer
15 years 3 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
IJNSEC
2007
14 years 10 months ago
2007
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
PKC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...