Article
Open Access
Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
-
R. Avanzi
Published/Copyright:
October 8, 2008
Received: 2008-01-11
Revised: 2008-04-14
Published Online: 2008-10-08
Published in Print: 2008-October
© de Gruyter 2008
Articles in the same Issue
- Some applications of finite geometry for secure network coding
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- A complete characterization of the evolution of RC4 pseudo random generation algorithm
- Advanced stochastic methods in side channel analysis on block ciphers in the presence of masking
Keywords for this article
Elliptic and hyperelliptic curves;
cryptography;
efficient implementation;
explicit formulæ
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Some applications of finite geometry for secure network coding
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- A complete characterization of the evolution of RC4 pseudo random generation algorithm
- Advanced stochastic methods in side channel analysis on block ciphers in the presence of masking
