Sciweavers

90 search results - page 13 / 18
» Fast implementations of RSA cryptography
Sort
View
FSE
2010
Springer
180views Cryptology» more  FSE 2010»
14 years 17 days ago
Fast Software AES Encryption
This paper presents new software speed records for AES-128 encryption for architectures at both ends of the performance spectrum. On the one side we target the low-end 8-bit AVR mi...
Dag Arne Osvik, Joppe W. Bos, Deian Stefan, David ...
EUROCRYPT
2007
Springer
14 years 1 months ago
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
Willi Geiselmann, Rainer Steinwandt
ISCC
2003
IEEE
112views Communications» more  ISCC 2003»
14 years 1 months ago
Performance Evaluation of Public-Key Cryptosystem Operations in WTLS Protocol
WTLS (Wireless Transport Layer Security) is an important standard protocol for secure wireless access to Internet services. WTLS employs public-key cryptosystems during the handsh...
Albert Levi, Erkay Savas
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
14 years 1 months ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...
CHES
2005
Springer
99views Cryptology» more  CHES 2005»
14 years 1 months ago
Short Memory Scalar Multiplication on Koblitz Curves
Abstract. We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We ...
Katsuyuki Okeya, Tsuyoshi Takagi, Camille Vuillaum...