Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)

  title={Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)},
  author={Dan Boneh and Richard J. Lipton},
Recently there has been a great deal of interest in the power of \Quantum Computers" [4, 15, 18]. The driving force is the recent beautiful result of Shor that shows that discrete log and factoring are solvable in random quantum polynomial time [15]. We use a method similar to Shor's to obtain a general theorem about quantum polynomial time. We show that any cryptosystem based on what we refer to as a `hidden linear form' can be broken in quantum polynomial time. Our results imply that the… CONTINUE READING
95 Citations
11 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 95 extracted citations


Publications referenced by this paper.
Showing 1-10 of 11 references

and Y

  • U. Maure
  • Yacobi,Non-interactive public-key cryptography…
  • 1991
1 Excerpt

System Based on Imaginary Quadratic Fields, Journal of Cryptology, vol

  • J. Buchmann, H. Williams, A Key Exchang
  • 1, no. 2, pp. 107{118,
  • 1988
1 Excerpt

Vandewalle , Hash Functions Based on Block Ciphers : A Synthetic Approach

  • R. Govaerts B. Preneel, J.
  • Proceedings of Crypto
  • 1985

Similar Papers

Loading similar papers…