PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nègre, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient regular modular exponentiation using multiplicative half-size splitting.

, and . J. Cryptographic Engineering, 7 (3): 245-253 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christophe Maufroy University of Stuttgart

 

Other publications of authors with the same name

Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation., and . IEEE Trans. Computers, 60 (4): 602-607 (2011)New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic., and . IEEE Trans. Computers, 64 (10): 2875-2890 (2015)Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products., , and . IEEE Trans. Computers, 62 (7): 1345-1361 (2013)Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $F_2^1223$., , and . Selected Areas in Cryptography, volume 7707 of Lecture Notes in Computer Science, page 166-183. Springer, (2012)Parallel Multiplication in F2n Using Condensed Matrix Representation.. SECRYPT, page 254-259. INSTICC Press, (2006)Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS., and . ACISP, volume 9144 of Lecture Notes in Computer Science, page 107-124. Springer, (2015)Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic.. INDOCRYPT, volume 3797 of Lecture Notes in Computer Science, page 389-402. Springer, (2005)Binary Edwards Curves Revisited., , and . INDOCRYPT, volume 8885 of Lecture Notes in Computer Science, page 393-408. Springer, (2014)Modular Multiplication in GF(pk) Using Lagrange Representation., , and . INDOCRYPT, volume 2551 of Lecture Notes in Computer Science, page 275-284. Springer, (2002)Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography., , , and . IEEE Symposium on Computer Arithmetic, page 181-187. IEEE Computer Society, (2003)