Sciweavers

PKC
2005
Springer
93views Cryptology» more  PKC 2005»
13 years 9 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
FPL
2005
Springer
127views Hardware» more  FPL 2005»
13 years 9 months ago
Efficient Hardware Architectures for Modular Multiplication on FPGAs
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
David Narh Amanor, Viktor Bunimov, Christof Paar, ...
SIPS
2007
IEEE
13 years 10 months ago
Montgomery Modular Multiplication Algorithm on Multi-Core Systems
In this paper, we investigate the efficient software implementations of the Montgomery modular multiplication algorithm on a multi-core system. A HW/SW co-design technique is use...
Junfeng Fan, Kazuo Sakiyama, Ingrid Verbauwhede