Efficient post-quantum cryptography for building advanced security applications

• Grant number: 15/50520-6
• Support Opportunities: Research Grants - Research Partnership for Technological Innovation - PITE
• Start date: August 01, 2016
• End date: July 31, 2019
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Computing Methodologies and Techniques
• Agreement: Intel
• Principal Investigator: Marcos Antonio Simplicio Junior
• Grantee: Marcos Antonio Simplicio Junior
• Host Institution: Escola Politécnica (EP). Universidade de São Paulo (USP). São Paulo , SP, Brazil
• Company: Intel Semicondutores do Brasil Ltda
• City: São Paulo
• Pesquisadores principais: Cíntia Borges Margi ; Paulo Sérgio Licciardi Messeder Barreto ; Wilson Vicente Ruggiero
• Associated scholarship(s): 18/21237-2 - Improving the state-of-the-art on post-quantum key exchange, BP.TT; 17/16092-2 - Code-based cryptosystems for the internet of things, BP.PD

Abstract

The goal of this project proposal is to specify, develop and analyse secure and hardware-friendly post-quantum cryptographic schemes for providing not only basic security services (e.g., data encryption, user authentication and digital signatures), but also more advanced ones (e.g., blind signatures, - homomorphic encryption, and password hashing schemes. Regarding basic services, the focus is on improving the performance of such schemes, possibly in terms of processing time and energy requirements, but especially in terms of key, signatures and cipher text sizes; one possible approach for tackling this issue is to consider compact structures for the underlying keys while preserving their security, which should also allow optimized implementations that take advantage of such structures. For the security perspective, we are interested not only on cryptanalytic attacks, but also in investigating implementation-related threats like side-channel attacks, proposing techniques to avert them. Regarding advanced services, the research should focus on expanding the range of applications that can be built from post-quantum schemes, while the literature focus mostly on basic services. In this case, the proposed approach is to adapt basic schemes to provide additional services while preserving (or improving) their security and efficiency, comparing the result with alternative pre- and post-quantum approaches (if they do exist). (AU)

Scientific publications

(4)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

ALKIM, ERDEM; BARRETO, PAULO S. L. M.; BINDEL, NINA; KRAEMER, JULIANE; LONGA, PATRICK; RICARDINI, JEFFERSON E.; CONTI, M; ZHOU, J; CASALICCHIO, E; SPOGNARDI, A. The Lattice-Based Digital Signature Scheme qTESLA. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY (ACNS 2020), PT I, v. 12146, p. 20-pg., 2020-01-01. (15/50520-6)

ZANON, GUSTAVO H. M.; SIMPLICIO, MARCOS A., JR.; PEREIRA, GEOVANDRO C. C. F.; DOLISKANI, JAVAD; BARRETO, PAULO S. L. M.; LANGE, T; STEINWANDT, R. Faster Isogeny-Based Compressed Key Agreement. POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2018, v. 10786, p. 21-pg., 2018-01-01. (13/25977-7, 15/50520-6)

DE CASTRO, LUCAS G.; OGAWA, HENRIQUE S.; ALBERTINI, BRUNO DE C.; IEEE. Automated Generation of HDL Implementations of Dadda and Wallace Tree Multipliers. 2017 VII BRAZILIAN SYMPOSIUM ON COMPUTING SYSTEMS ENGINEERING (SBESC), v. N/A, p. 6-pg., 2017-01-01. (15/50520-6)

ZANON, GUSTAVO H. M.; SIMPLICIO, JR., MARCOS A.; PEREIRA, GEOVANDRO C. C. F.; DOLISKANI, JAVAD; BARRETO, PAULO S. L. M.. Faster Key Compression for Isogeny-Based Cryptosystems. IEEE TRANSACTIONS ON COMPUTERS, v. 68, n. 5, p. 688-701, MAY 2019. (15/50520-6)