Advanced search
Start date

Efficiency and security of pre and post quantum cryptographic methods: theory and applications

Grant number: 16/50476-0
Support type:Regular Research Grants
Duration: April 01, 2017 - September 30, 2019
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Cooperation agreement: Carleton University
Mobility Program: SPRINT - Projetos de pesquisa - Mobilidade
Principal Investigator:Ricardo Dahab
Grantee:Ricardo Dahab
Principal investigator abroad: Daniel Panário
Institution abroad: Carleton University, Canada
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
Associated research grant:13/25977-7 - Security and reliability of Information: theory and practice, AP.TEM


Cryptography is at the basis of virtually every existing security solution for information systems. Its study has blossomed into a full-fledged area in the intersection of Mathematics, Statistics, Computing and Engineering, bringing together Algebra, Geometry, Number Theory, Complexity Theory, and quantum-specialized versions of these fields. Research in efficient and secure cryptographic algorithms and protocols is built upon layers of theoretical science mixed with technological issues. Even symmetric cryptography, usually less reliant on algorithm complexity, has benefited from interactions with finite fields and algebra. Accordingly, this proposal aims precisely at strengthening ties among researchers of these cryptography-affine areas, in order to exploit research challenges in Pre- and Post-quantum Cryptography (especially Lattice and Code-based), areas rich in interactions of Finite Fields, Number Theory and Computer Science. Our proposal leverages on the ongoing FAPESP Thematic Project "Security and Reliability of Information: Theory and Practice", which intermingles Math, CS and Engineering as a basis for Information Security and Cryptography. For the UNICAMP group, Carleton's researchers will be a great boost for its world-class expertise in areas as Finite Fields, Coding, Combinatorics and Finite Geometry; for the Carleton group, it will be an excellent opportunity to expand its research horizons to include Pre- and Post-quantum Crvptoqraphv, which have been the focus of part of the UNICAMP group for over 20 years. (AU)

Scientific publications
(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)
CARDELL, SARA D.; ARANHA, DIEGO F.; FUSTER-SABATER, AMPARO. Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs. LOGIC JOURNAL OF THE IGPL, v. 28, n. 4, p. 430-448, AUG 2020. Web of Science Citations: 0.
CARDELL, SARA D.; CLIMENT, JOAN-JOSEP; PANARIO, DANIEL; STEVENS, BRETT. A CONSTRUCTION OF F-2-LINEAR CYCLIC, MDS CODES. Advances in Mathematics of Communications, v. 14, n. 3, p. 437-453, AUG 2020. Web of Science Citations: 0.

Please report errors in scientific publications list by writing to: