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...
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
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...
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...
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...