%0 Journal Article
%T Cryptographic applications in FPGA
%A Deschamps
%A J.-P.
%J Latin American applied research
%D 2007
%I Scientific Electronic Library Online
%X this paper describes circuits for executing the most complex operations of public-key cryptography and gives estimations of their execution time within field programmable devices. the following operations are considered: mod n exponentiation, mod p division, mod f(x) multiplication of polynomials, mod f(x) division of polynomials and point multiplication over an elliptic curve.
%K public-key cryptography
%K finite fields
%K arithmetic
%K programmable devices
%K fpga.
%U http://www.scielo.org.ar/scielo.php?script=sci_abstract&pid=S0327-07932007000100002&lng=en&nrm=iso&tlng=en