Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.

From MaRDI portal
Revision as of 00:53, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5944106

DOI10.1007/s001450010012zbMath1050.11100OpenAlexW1586812950MaRDI QIDQ5944106

Christof Paar, Daniel V. Bailey

Publication date: 7 November 2001

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001450010012




Related Items (12)




This page was built for publication: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.