Sciweavers

164 search results - page 16 / 33
» Implementation of the GBD Cryptosystem
Sort
View
EUROPAR
2010
Springer
13 years 11 months ago
Parallel Enumeration of Shortest Lattice Vectors
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
Özgür Dagdelen, Michael Schneider 0002
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 2 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
13 years 10 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu
ARC
2006
Springer
154views Hardware» more  ARC 2006»
14 years 1 months ago
Reconfigurable Modular Arithmetic Logic Unit for High-Performance Public-Key Cryptosystems
This paper presents a reconfigurable hardware architecture for Public-key cryptosystems. By changing the connections of coarse grain Carry-Save Adders (CSAs), the datapath provides...
Kazuo Sakiyama, Nele Mentens, Lejla Batina, Bart P...
MASCOTS
2001
13 years 11 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement