National audienceIn this work, we present a new arithmetic unit for the multiplication in prime finite fields. This modular multiplier is intended to be part of an hardware accelerator dedicated to Hyper-Elliptic Curve Cryptography. Various configurations of the multiplier have been implemented in different FPGAs. We will present the results we obtained in terms of circuit area and computation time and we will make the comparison with the actual state-of-the-art in mplementation of modular multipliers
144 p.The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computat...
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
International audienceModular multiplication is the most costly and common operation in hyper-ellipt...
National audienceIn this work, we present a new arithmetic unit for the multiplication in prime fini...
International audienceIn this paper, we present modular multipliers for hardware implementations of ...
The higher computational complexity of an elliptic curve scalar point multiplication operation limit...
International audienceThe paper presents overview of the most interesting GF (2^m) algorithms and pr...
Finite field arithmetic over GF (2 to the nth) is particularly attractive for efficient implementati...
This paper proposes an FPGA-based application-specific elliptic curve processor over a prime field. ...
International audienceIn this paper we provide a comparison of different modular multipliers suitabl...
The finite field modular multiplier is the most critical component in the elliptic curve crypto proc...
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with a ...
144 p.The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computat...
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
International audienceModular multiplication is the most costly and common operation in hyper-ellipt...
National audienceIn this work, we present a new arithmetic unit for the multiplication in prime fini...
International audienceIn this paper, we present modular multipliers for hardware implementations of ...
The higher computational complexity of an elliptic curve scalar point multiplication operation limit...
International audienceThe paper presents overview of the most interesting GF (2^m) algorithms and pr...
Finite field arithmetic over GF (2 to the nth) is particularly attractive for efficient implementati...
This paper proposes an FPGA-based application-specific elliptic curve processor over a prime field. ...
International audienceIn this paper we provide a comparison of different modular multipliers suitabl...
The finite field modular multiplier is the most critical component in the elliptic curve crypto proc...
This work presents a scalable digit-parallel finite field polynomial multiplier architecture with a ...
144 p.The security strength of Public Key Cryptosystems (PKCs) is attributed to the complex computat...
The groundbreaking idea of public key cryptography and the rapid expansion of the internetin the 80s...
International audienceModular multiplication is the most costly and common operation in hyper-ellipt...