Sciweavers

164 search results - page 20 / 33
» Implementation of the GBD Cryptosystem
Sort
View
IJNSEC
2006
94views more  IJNSEC 2006»
13 years 9 months ago
A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
Sangook Moon
JCP
2007
127views more  JCP 2007»
13 years 9 months ago
Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...
Andrew Byrne, Nicolas Meloni, Arnaud Tisserand, Em...
JOC
2010
106views more  JOC 2010»
13 years 8 months ago
A Taxonomy of Pairing-Friendly Elliptic Curves
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairingbased cryptographic systems. Such “pairing-friendly” curv...
David Freeman, Michael Scott, Edlyn Teske
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
14 years 1 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
14 years 2 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui