Diophantine approximation attack on a fast public key cryptosystem

Authors:
Wang Baocang;Hu Yupu
Affiliations:
Key Laboratory of Computer Networks & Information Security, Ministry of Education, Xidian University, Xi'an, P.R. China;Key Laboratory of Computer Networks & Information Security, Ministry of Education, Xidian University, Xi'an, P.R. China
Venue:
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Year:
2006

Citing 8
Cited 3

A public-key cryptosystem with worst-case/average-case equivalence

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A Proposal of a New Public Key Cryptosystem Using Matrices over a Ring

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
New Public-Key Cryptosystem Using Braid Groups

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
New Public Key Cryptosystem Using Finite Non Abelian Groups

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Public-Key Cryptosystems from Lattice Reduction Problems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000

ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy

A knapsack-based probabilistic encryption scheme

Information Sciences: an International Journal
Quadratic compact knapsack public-key cryptosystem

Computers & Mathematics with Applications
Implicit polynomial recovery and cryptanalysis of a combinatorial key cryptosystem

ICICS'12 Proceedings of the 14th international conference on Information and Communications Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

At ACISP 2000, H. Yoo etc. proposed a public key cryptosystem using matrices over a ring, which was analyzed using lattice basis reduction algorithms by Youssef etc. at ACISP 2001. In this paper, another attack, namely Diophantine approximation attack, is presented. It is shown that the decryption of the cryptosystem can be transformed into solving the simultaneous Diophantine approximation problem, which can be approximated by lattice basis reduction algorithms. So we heuristically explain that the scheme is insecure. Furthermore, our new attack is more general than lattice attack.