Sciweavers

104 search results - page 2 / 21
» A Survey of Fast Exponentiation Methods
Sort
View
AINA
2003
IEEE
13 years 11 months ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
TIT
2011
152views more  TIT 2011»
13 years 11 days 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,...
PE
2007
Springer
137views Optimization» more  PE 2007»
13 years 5 months ago
A prediction method for job runtimes on shared processors: Survey, statistical analysis and new avenues
Grid computing is an emerging technology by which huge numbers of processors over the world create a global source of processing power. Their collaboration makes it possible to pe...
Menno Dobber, Robert D. van der Mei, Ger Koole
ASIACRYPT
2001
Springer
13 years 10 months ago
Speeding Up XTR
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
Martijn Stam, Arjen K. Lenstra
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
14 years 5 days ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki