Manuel Charlemagne

According to our database, Manuel Charlemagne authored at least 7 papers between 2008 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2013

A note on the practical complexity of the NFS in the medium prime case: Smoothness of Norms.

Naomi Benger, Manuel Charlemagne, Kefei Chen

IACR Cryptol. ePrint Arch., 2013

Leakage-resilient lossy trapdoor functions and public-key encryption.

Baodong Qin, Shengli Liu, Kefei Chen, Manuel Charlemagne

Proceedings of the first ACM workshop on Asia public-key cryptography, 2013

2010

Identity-based encryption based on DHIES.

Yu Chen, Manuel Charlemagne, Zhi Guan, Jian-bin Hu, Zhong Chen

Proceedings of the 5th ACM Symposium on Information, 2010

2009

Fast Hashing to <i>G</i>₂ on Pairing-Friendly Curves.

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa

Proceedings of the Pairing-Based Cryptography, 2009

2008

Fast hashing to G2 on pairing friendly curves.

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa

IACR Cryptol. ePrint Arch., 2008

On the final exponentiation for calculating pairings on ordinary elliptic curves.

Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, Ezekiel J. Kachisa

IACR Cryptol. ePrint Arch., 2008

On the security of pairing-friendly Abelian varieties over non-prime fields.

Naomi Benger, Manuel Charlemagne, David Mandell Freeman

IACR Cryptol. ePrint Arch., 2008