Sciweavers

861 search results - page 10 / 173
» Faster integer multiplication
Sort
View
JC
2010
47views more  JC 2010»
13 years 6 months ago
A low complexity probabilistic test for integer multiplication
Dima Grigoriev, Gerald Tenenbaum
TIT
2011
152views more  TIT 2011»
13 years 2 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 27 days ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
12 years 11 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...