|Ph.D.||Computer Science, Dublin City University, Ireland (2010)|
|M.E.||Mathematics, France (2006)|
|B.E.||Physics, France (2004)|
|2014 – pres.||Lecturer in Mathematics and Computer Science, UM-SJTU Joint Institute|
|2012 – pres.||IT manager, Peak Solution – Shanghai|
|2013||Academic writer, Department of Computer Science, SJTU|
|2011 – 2013||Post-Doctor, Department of Computer Science, SJTU|
|2006 – 2007||Research assistant, Department of Computer Science, University of Aarhus, Denmark|
- N. Benger, M. Charlemagne, and D. Mandell Freeman. On the security of pairing-friendly abelian varieties over non-prime fields. In Pairing, volume 5671 of Lecture Notes in Computer Science, pages 52–65. Springer, 2009.
- Y. Chen, M. Charlemagne, Z. Guan, J. Hu, and Z. Chen. Identity-based encryption based on DHIES. In ASIACCS, pages 82–88, 2010.
- N. Benger and M. Charlemagne. A note on the practical complexity of the NFS in the medium prime case: Smoothness of norms. In IACR, 2013.
Courses Taught (Recent 5 Years)
- UM-SJTU JI: Vg 101 Introduction to Computer and Proramming; Ve 203 Discrete Mathematics, Ve 482 Introduction to Operating Systems, Ve 475 Introduction to Cryptography, Ve 477 Introduction to Algorithms, and Vg 500 Technical Communication.