Sciweavers

362 search results - page 5 / 73
» Abstraction in Cryptography
Sort
View
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 4 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
97
Voted
EUROCRYPT
2009
Springer
15 years 11 months ago
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
Steven D. Galbraith, Xibin Lin, Michael Scott
DCC
2007
IEEE
15 years 10 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
90
Voted
FDL
2007
IEEE
15 years 2 months ago
A Domain Specific Language for Cryptography
In this paper, we propose a domain specific language for the development of hardware/software cryptographic systems based on the well known Python programming language. It is desi...
Giovanni Agosta, Gerardo Pelosi
90
Voted
ASIACRYPT
2006
Springer
15 years 2 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...