231 search results - page 8 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
FLOPS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
TIT
2010
13 years 2 months ago
2010
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...