Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Home
Publications
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Daniel V. Bailey
Daniel V. Bailey
Christof Paar
Christof Paar
Publisher Website
Google Scholar
Add to library
Cite
Download
Share
Download
1 June 2001
journal article
Published by
Springer Nature
in
Journal of Cryptology
Vol. 14
(3)
,
153-176
https://doi.org/10.1007/s001450010012
Abstract
No abstract available
Keywords
KEY WORDS. FINITE FIELDS
FAST ARITHMETIC
BINOMIALS
MODULAR REDUCTION
ELLIPTIC CURVES
INVERSION.
Cited by 83 articles