CRII: SaTC: Design, Implementation, and Analysis of Quantum-Resistant Algorithms on Smart Handheld Embedded Devices

量子计算机的前景对目前使用的公钥密码算法的安全性构成了威胁。人们普遍认为，包括RSA和ECC在内的两种公钥密码体制都会被采用某些算法的量子计算机破解。虽然还不存在大规模的量子计算机，但目标是在预期量子计算机的情况下开发抗量子密码系统，因为当今互联网上使用的大多数公钥密码算法都基于容易受到量子攻击的算法。这个项目将探索椭圆曲线上的同源，作为量子抵抗密码学的基础。同源计算是众所周知的困难。这个项目将分析更新和更快的同源基因家族，这将产生一个更快的解决方案来寻找同源基因的问题。它将利用最先进的技术和新的优化来加快基于同源的密码学的计算速度，包括塔场和曲线算法。域算术计算的性能受到处理器微体系结构特征、操作数的大小、算法以及与之相关的编程技术的强烈影响。这项研究将为开发适用于新兴嵌入式系统的后量子密码计算的快速算法和体系结构提供初步结果。欲了解更多信息，请访问项目网站：http://people.rit.edu/~rxaeec/Research.html

The prospect of quantum computers is a threat against the security of currently used public key cryptographic algorithms. It has been widely accepted that, both public key cryptosystems including RSA and ECC will be broken by quantum computers employing certain algorithms. Although large-scale quantum computers do not yet exist, but the goal is to develop quantum-resistant cryptosystems in anticipation of quantum computers as most of the public key cryptography that is used on the Internet today is based on algorithms that are vulnerable to quantum attacks. This project will explore isogenies on elliptic curves as a foundation for quantum-resistant cryptography. Isogeny computation is known to be difficult. This project will analyze newer and faster families of isogenies, which yield a faster solution to the problem of finding isogenies. It will exploit state-of-the-art techniques and employ new optimizations to speed up the computation in isogeny-based cryptography, including tower field and curve arithmetic. The performance of field arithmetic computation is strongly influenced by the processor micro-architecture features, the size of the operands, the algorithms, and programming techniques associated to them. This research will provide preliminary results on developing fast algorithms and architectures for post-quantum cryptographic computations suitable for emerging embedded systems. For further information see the project website at: http://people.rit.edu/~rxaeec/Research.html