Le Duc Phong

Curriculum Vitae

PERSONAL DETAILS

Birth September 1, 1979

Address Jurong East Street 21, Singapore

Phone (+65) 8782 1335

Mail acwun1@r.postjobfree.com

WORK EXPERIENCE

TS Senior Security Analyst 05/2016 - present

UL-Transaction Security, Full-time

Identifying vulnerabilities of cryptographic algorithms (RSA, ECC, DES, implemented on Payment Smart Cards.

Testing and Certifying the security of cryptographic algorithms implemented on Payment Smart Cards.

Performing side-channel analysis against cryptographic algorithms implemented on Payment Smart Cards.

Analyzing state-of-the-art side-channel attacks such as SPA, CPA, Template Attacks on various algorithms used in embedded systems (AES, DES, RSA, . . . ). Research Scientist 10/2010 - 04/2016

National University of Singapore, Full-time

Doing research on various topics in public-key cryptography:

{ E cient Pairing Computation: The aim of this project is to study techniques for e cient implementations of cryptographic pairings.

{ Generation of Pairing-Friendly Elliptic Curves: This project aims at studying di erent methods to generate pairing-friendly elliptic curves. A number of pairing-friendly elliptic curves were generated.

{ Algorithmic Countermeasures against Implementation Attacks on Public-Key Cryptog- raphy: In this project, I worked on countermeasures to prevent side channel analysis as well as fault attacks on public key cryptosystems.

{ Secure Implementation of ECDSA: Implement an secure implementation of elliptic curve digital signature algorithm against Implementation attacks.

{ Edwards Curves in Cryptography: study the use Edwards curves in cryptography.

Software:

{ Secure ECDSA: a secure implementation of Elliptic Curve Digital Signature Al- gorithm (ECDSA) against side channel analysis and fault attacks. The software is implemented in C and based on GMP library.

{ SHA2: an implementation of SHA2 hash functions family in C.

{ GenCur: a software in MAGMA that implemented the most well-known methods for generating pairing-friendly elliptic curves: Cock-Pinch, Brezing-Weng, MNT.

{ ECM: an implementation of the ECM method for integers factorization using MAGMA.

{ Tlpairing: a software for computing pairings (written in C based on NTL library.

Postdoctoral Fellow 10/2009 - 07/2010

University of Caen, France.

Working on the ANR Research Project: Pairing-based cryptology and E-cash. Research-assistant Engineer 06/2005 - 09/2006

INRIA Sophia-Antipolis, France.

Working on the project: OSA (Open Simulation Architecture), an open component-based architecture for discrete-event simulations based on the ObjectWeb’s Fractal component model and the Eclipse platform.

Teaching Assistant 09/2001 - 2005

Vietnam National University, Hanoi.

EDUCATION

Ph.D in Computer Science 2006-2009

Universit e de Pau et des Pays de l’Adour, Pau, France. Thesis: Cryptographic Protocols : Multisignature and Timestamping. Advisor: Professor Alban Gabillon

Co-Advisor: Professor Alexis Bonnecaze

MSc. in Computer Science 2003-2005

Institut de la Francophonie pour l’Informatique.

Thesis: Approximation algorithms for fractional packing and covering problems. Advisor: St ephane P erennes

Bachelor of Science in Informatics 1997-2001

Vietnam National University, Hanoi

SKILLS

Operating systems: DOS, Windows, Unix and Linux.

Programming languages: Pascal, 80x86 Assembler, C, C++, JAVA, PHP. IDE Platform: Eclipse, Microsoft Visual Studio.

Crypto library: GMP, NTL, MIRACL, OpenSSL.

Scienti c softwares MATLAB, MAGMA, LATEX.

Languages: Vietnamese (mother tongue), English (

uent), French (

uent). Other: Creative, motivated and strong critical and analytic thinking. PUBLICATIONS

Collaborators

Alban Gabillon, Alexis Bonnecaze, Fabien Laguillaumie, John Boxall, Nadia El Mbrabet, Chao Liang Liu, Tan Chik How, Matthieu Rivain, Micheal Tunstall, Phu-Binh Nguyen, Ronan Lashermes, Alexandre Venelli.

Works on Progress

1. Breaking the Yen et al. Exponentiation Algorithm, (with Chik How Tan). Submitted. 2. E cient Random Order Exponentiation Algorithms (submitted). Journal

1. Further Re nements of Miller’s algorithm on Edwards Curves, (with Chik How Tan). Applicable Algebra in Engineering, Communication and Computing (In Press). 2. Breaking an ID-based Encryption Based on Discrete Logarithm and Factorization Problems, (with Chik How Tan, Theo Fanuela Prabowo). Information Processing Letters (In Press).

3. Re nements of Miller’s algorithm for Weil/Tate pairings computation over Weier- strass Curves Revisited, (with Chao-Liang Liu). The Computer Journal, Vol.54, No.10, pp:1582-1591.

4. Improved Miller’s Algorithm for Computing Pairings on Edwards Curves, (with Chik How Tan). IEEE Transactions on Computers, Vol.63, No.10, pp:2626-2632. Conference Publications

1. On Near Prime-Order Elliptic Curves with small embedding degrees, (with Matthieu Rivain, Chik How Tan). In The 6th International Conference on Algebraic Informat- ics (CAI 2015), Stuttgart, Germany. Lecture Notes in Computer Science Volume 9270, 2015, pp: 140{151.

2. Randomizing the Montgomery Powering Ladder, (with Micheal Tunstall, Chik How Tan). In The 9th International Conference Information Security Theory and Practice (WISTP 2015), Heraklion, Crete, Greece. Lecture Notes in Computer Science Volume 9311, 2015, pp: 169{184.

3. On Double Exponentiation for Securing RSA against Fault Analysis, (with Matthieu Rivain, Chik How Tan). In CR-RSA 2014, San Francisco, USA. Lecture Notes in Computer Science Volume 8366, 2014, pp: 152{168.

4. Speeding up Pairing Computation in A ne Coordinates, (with Chik How Tan). In The 15th Annual International Conference on Information Security and Cryptology

(ICISC 2012), Seoul, Korea, 28{30 November 2012. Lecture Notes in Computer Science Volume 7839, 2013, pp:262-277.

5. Fast Points Quadrupling on Elliptic Curves, (with Nguyen Phu Binh). In Third International Symposium on Information and Communication Technology, Halong, Vietnam, 2012. Proceeding SoICT ’12, pp: 218{222.

6. Improved Precomputation Schemes for Scalar on Elliptic Curves, (with Chik How Tan). In Thirteenth IMA International Conference on Cryptography and Coding

(IMACC 2011), Oxford, UK, 12 December 2011 - 15 December 2011. Lecture Notes in Computer Science Volume 7089, 2011, pp:327{343. 7. A Variant of Miller’s Formula and Algorithm, (with John Boxall, Nadia El Mrabet and Fabien Laguillaumie). In The Fourth International Conference on Pairing-based Cryptography (Pairing 2010), Volume 6487/2010 of LNCS, pages 417{434. 13 - 15 December 2010. Japan.

8. Multisignatures as secure as the Di e-Hellman problem, (with Alexis Bonnecaze, Alban Gabillon). In The third International Conference on Pairing-based Cryptog- raphy (Pairing 2009), Volume 5671 of LNCS, pages 35{51. August 12-14, 2009. USA.

9. Sign-timing Scheme based on Aggregate Signatures, (with Alexis Bonnecaze, Alban Gabillon). In Proceedings of the IEEE international conference on Intelligence and Security Informatics (ISI 2008). June 17{20, 2008. Taiwan. 10. A Secure Round-based Timestamping Scheme, (with Alexis Bonnecaze, Alban Gabillon). In Fourth International Conference on Information Systems Security

(ICISS 2008), Volume 5332 of LNCS, pages 116{123, Hyderabad, India, 2008. 11. Multisignature Schemes with tight reduction in the plain public key model, (with Alexis Bonnecaze, Alban Gabillon). In Proc of the conference on security in network architecture and information systems (SARSSI 2008). October 2008, Loctudy, France.

12. A New Multisignature Scheme based on Strong Di e-Hellman Assumption, (with Alban Gabillon). In Proc of the conference on security in network architecture and information systems (SARSSI 2007). June 2007, Annecy, France. Research Reports

1. E cient Implementation of Cryptographic Pairings, June 2011. Temasek Laborato- ries, NUS.

2. Generating Pairing-Friendly Elliptic Curves, June 2012. Temasek Laboratories, NUS.

3. Countermeasures against Physical Attacks on Public-Key Cryptography, October 2014. Temasek Laboratories, NUS.

4. Secure Implementation of ECDSA, December 2015. Temasek Laboratories, NUS. SCHOLARSHIPS AND AWARDS

Research Allowance of General Council of Landes for 3 years PhD, France, 2006 - 2009.

Scholarship for Master at the Francophone Institute for Computer Science, 2003 - 2005.

Scholarship from Ministry of Education, Vietnam, 1997 - 2001.

Contact this candidate