Concepedia

The mpFq library and implementing curve-based key exchanges

Pierrick Gaudry, Emmanuel Thomé

HAL (Le Centre pour la Communication Scientifique Directe) · 2007 · 49 citations · 4 references

Open access

Concepts

ComputingComputer EngineeringComputer ScienceAlgorithmsCryptographyTheory Of ComputationElliptic Curve CryptographyElliptic CurvesArithmetic Of Finite FieldsElliptic Curve ArithmeticElliptic Curve Cryptography ImplementationElliptic Curve EncryptionElliptic Curve Key ExchangeFinite Field ArithmeticFinite Field ComputationSpecialized Code Generation

Abstract

International audience

References

4

Modular multiplication without trial division

Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations

Natural Sciences, Computer Science, Mathematics +9

Fast genus 2 arithmetic based on Theta functions

Pierrick Gaudry · Journal of Mathematical Cryptology · 2007 · 118 citations · Full text

Computing, Computer Science, Mathematics +14

Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems

Thomas Wollinger, Jan Pelzl, Christof Paar · IEEE Transactions on Computers · 2005 · 38 citations

Computing, Computer Engineering, Computer Science +11

Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ

Roberto Avanzi, Nicolas Thériault, Zhonghua Wang · Journal of Mathematical Cryptology · 2008 · 27 citations · Full text

Computing, Computer Science, Mathematics +14