IACR
2011
12 years 4 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
ISCA
2006
IEEE
13 years 5 months ago
2006
IEEE
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
ISCA
2005
IEEE
13 years 10 months ago
2005
IEEE
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
