Sciweavers

90 search results - page 11 / 18
» Fast implementations of RSA cryptography
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
ASIACRYPT
2003
Springer
14 years 1 months ago
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
Iwan M. Duursma, Hyang-Sook Lee
AINA
2006
IEEE
14 years 1 months ago
Distributed Key Management for Secure Role based Messaging
Secure Role Based Messaging (SRBM) augments messaging systems with role oriented communication in a secure manner. Role occupants can sign and decrypt messages on behalf of roles....
Gansen Zhao, Sassa Otenko, David W. Chadwick
FSE
2003
Springer
137views Cryptology» more  FSE 2003»
14 years 1 months ago
Turing: A Fast Stream Cipher
Abstract. This paper proposes the Turing stream cipher. Turing offers up to 256-bit key strength, and is designed for extremely efficient software implementation.It combines an LFS...
Gregory G. Rose, Philip Hawkes
CHES
2004
Springer
187views Cryptology» more  CHES 2004»
14 years 1 months ago
A New Attack with Side Channel Leakage During Exponent Recoding Computations
In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and c...
Yasuyuki Sakai, Kouichi Sakurai