Sciweavers

20831 search results - page 65 / 4167
» Quantum Computation and Information
Sort
View
ASIACRYPT
2009
Springer
14 years 3 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
IDTRUST
2009
ACM
14 years 3 months ago
Quantum resistant public key cryptography: a survey
Public key cryptography is widely used to secure transactions over the Internet. However, advances in quantum computers threaten to undermine the security assumptions upon which c...
Ray A. Perlner, David A. Cooper
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 8 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson

Lecture Notes
889views
15 years 8 months ago
Future Directions in Computing
Silicon-based electronics is the foundation of computing devices. The computer industry is reaching an important milestone, where physical limits arising from using optical lithogr...
Sherief Reda
STACS
1999
Springer
14 years 1 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer