Sciweavers

16 search results - page 1 / 4
» Parametric, Secure and Compact Implementation of RSA on FPGA
Sort
View
RECONFIG
2008
IEEE
268views VLSI» more  RECONFIG 2008»
13 years 11 months ago
Parametric, Secure and Compact Implementation of RSA on FPGA
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
Ersin Oksuzoglu, Erkay Savas
CCS
2007
ACM
13 years 10 months ago
Compact FPGA implementations of QUAD
QUAD is a stream cipher whose provable security relies on the hardness of solving systems of multivariate quadratic equations. This paper explores FPGA implementations of the stre...
David Arditti, Côme Berbain, Olivier Billet,...
DATE
2008
IEEE
140views Hardware» more  DATE 2008»
13 years 11 months ago
FPGA Design for Algebraic Tori-Based Public-Key Cryptography
Algebraic torus-based cryptosystems are an alternative for Public-Key Cryptography (PKC). It maintains the security of a larger group while the actual computations are performed i...
Junfeng Fan, Lejla Batina, Kazuo Sakiyama, Ingrid ...
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
13 years 9 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
13 years 10 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama