Title :
kth least significant bit of a plaintext in reciprocal number cryptosystem
Author_Institution :
Tokyo Institute of Technology, Department of Information Processing, Graduate School at Nagatsuta, Yokohama, Japan
Abstract :
Breaking the public key cryptosystem proposed by the author has been proven to be as hard as factoring a large number. The letter shows that guessing the kth least significant bit of a plaintext is also as difficult as factorisation (k ¿ log n, where n is the bit length of a plaintext).
Keywords :
cryptography; security of data; factoring; factorisation; kth least significant bit; plaintext; public key cryptosystem; reciprocal number cryptosystem;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19870574
