The rapid development of quantum computing technology brings to the fore the potential for polynomial-time algorithms for solving complex mathematical problems of modern public key cryptography (integer factoring, discrete logarithm, discrete logarithm of elliptic curve).
Post-quantum cryptography explores alternative public-key algorithms that may be resistant to attacks on quantum computers using Shor's algorithm.
The new call is open to research proposals that lead to a better comparative understanding of approaches in post-quantum cryptography and to new optimization techniques based on metrics such as: implementation complexity; performance; energy requirements; code size; data structure size; storage requirements; and vulnerability to side channel attacks.
Research proposals, while hardware-focused on the subjects they will explore, may include software for rapid development and maximum flexibility in prototyping and performance studies.
Fapesp and Intel expect to select a set of research proposals lasting up to two years. Selected projects will be renewable annually if they have satisfactory progress and continued commitment to the direction of research.
The call for proposals is available at: www.fapesp.br/9719.
Source: FAPESP Agency