Sciweavers

90 search results - page 14 / 18
» Fast implementations of RSA cryptography
Sort
View
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
13 years 11 months ago
Efficient Generation of Prime Numbers
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
Marc Joye, Pascal Paillier, Serge Vaudenay
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
14 years 2 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
FSE
2004
Springer
90views Cryptology» more  FSE 2004»
14 years 1 months ago
Fast Software-Based Attacks on SecurID
SecurID is a widely used hardware token for strengthening authentication in a corporate environment. Recently, Biryukov, Lano, and Preneel presented an attack on the alleged SecurI...
Scott Contini, Yiqun Lisa Yin
KES
2008
Springer
13 years 6 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Data Base
Privacy is one of the most important properties of an information system must satisfy. In which systems the need to share information among different, not trusted entities, the pro...
Mahmoud Hussein, Ashraf El-Sisi, Nabil A. Ismail
CEE
2007
110views more  CEE 2007»
13 years 7 months ago
HW/SW co-design for public-key cryptosystems on the 8051 micro-controller
It is a challenge to implement large word length public-key algorithms on embedded systems. Examples are smartcards, RF-ID tags and mobile terminals. This paper presents a HW/SW c...
Kazuo Sakiyama, Lejla Batina, Bart Preneel, Ingrid...