Cryptographic applications in FPGA

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.