Sciweavers

164 search results - page 10 / 33
» Implementation of the GBD Cryptosystem
Sort
View
FPL
2005
Springer
127views Hardware» more  FPL 2005»
14 years 3 months ago
Efficient Hardware Architectures for Modular Multiplication on FPGAs
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
David Narh Amanor, Viktor Bunimov, Christof Paar, ...
JSS
2007
79views more  JSS 2007»
13 years 9 months ago
Security problems with improper implementations of improved FEA-M
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
Shujun Li, Kwok-Tung Lo
EUROCRYPT
2010
Springer
14 years 2 months ago
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
14 years 3 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
TC
2010
13 years 4 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...