17 search results - page 1 / 4 » A Fast Semantically Secure Public Key Cryptosystem Based on ... |
IJNSEC
2006
13 years 5 months ago
2006
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...
ECCC
2008
13 years 5 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
ACISP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
CCS
1998
ACM
13 years 9 months ago
1998
ACM
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one d...