Services on Demand
Journal
Article
Indicators
- Cited by SciELO
Related links
- Similars in SciELO
Share
Latin American applied research
Print version ISSN 0327-0793
Abstract
DESCHAMPS, J.-P.. Cryptographic applications in FPGA. Lat. Am. appl. res. [online]. 2007, vol.37, n.1, pp.3-10. ISSN 0327-0793.
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.
Keywords : Public-Key Cryptography; Finite Fields; Arithmetic; Programmable Devices; FPGA.
· text in English · English
(
pdf
)