Sciweavers

231 search results - page 5 / 47
» Algorithms for Quantum Computation: Discrete Logarithms and ...
Sort
View
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
13 years 11 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
Amir Fijany, Colin P. Williams
IMA
2001
Springer
78views Cryptology» more  IMA 2001»
13 years 12 months ago
Unconditionally Secure Key Agreement Protocol
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
Cyril Prissette
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
13 years 11 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
SPAA
2003
ACM
14 years 22 days ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 7 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson