231 search results - page 25 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
SIGGRAPH
1994
ACM
13 years 11 months ago
1994
ACM
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
MOC
2010
13 years 2 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
ANTS
2004
Springer
13 years 11 months ago
2004
Springer
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
ISSAC
2004
Springer
14 years 28 days ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...