Efficient and reliable computations for lightweight and/or high-performance cryptosystems: algorithms, architectures, designs and implementations

随着信息、计算机和通信技术和系统的飞速发展，海量数据需要在用户之间进行处理、存储和交换，这使得数据完整性和信息安全问题变得非常重要。为了保护数据并使其安全，各种加密原语被整合到许多标准和协议中，并在广泛的平台上实施；从用于服务器和基站的强大计算机到用于无线设备的轻量级密码系统。密码系统的性能在很大程度上依赖于高效的密码计算，特别是在资源受限的嵌入式系统中，如智能卡、RFID标签、物联网和无线传感器网络中的节点，这些系统的功耗、内存和带宽都非常有限。由于密码计算的复杂性，可靠而高效的密码计算的设计和实现是具有挑战性的。研究的主要目标概括如下： (I)我们将研究有限域算术运算的新的高效算法和体系结构的发展，例如使用多项式、移位多项式和高斯正规基表示的二进制扩域中的乘法、平方、求逆和求幂。我们将考虑它们在ASIC和FPGA中的设计和实现。对于每个工作平台，我们计划为轻量级和高性能应用程序进一步优化这些操作，以实现低资源和/或高速计算。 (Ii)我们将研究一些基于我们新提出的乘子的公钥和私钥密码体制的设计和实现。有限域乘法是椭圆曲线和基于指数的密码体制、AES-GCM认证加密和WG流密码中使用的主要算术运算。为了进一步优化这些密码系统的两端应用，即轻量级和高性能的密码系统，我们将研究使用不同的数字级乘法器的效果。 (Iii)我们将探索新的可靠和健壮的私钥和公钥密码体制方案，以对抗自然故障和故障攻击。由于故障攻击已经成为密码应用中的一个严重问题，因此这项研究非常重要。该研究将基于采用具有低开销和可接受的检错能力的高效并发差错控制编码方法。 这一研究将以更低的成本和更高的性能开发出更安全可靠的密码系统。它还将大大促进为学术界和加拿大信息和通信技术(信通技术)部门的大量公司培训高素质人员。

With rapid advances in information, computer and communication technologies and systems, huge amount of data has to be processed, stored and exchanged among users, which makes data integrity and information security very important issues. To protect the data and make it secure, various cryptographic primitives are being incorporated in many standards and protocols and implemented in a wide range of platforms; from powerful computers used in servers and base stations to lightweight cryptosystems used in wireless devices. The performance of cryptosystems rely heavily on efficient cryptographic computations, specially in resource constrained embedded systems, such as smart cards, RFID tags, Internet of Things, and nodes in wireless sensor networks, where the power consumption, memory, and bandwidth are very limited. Reliable and efficient design and implementation of cryptographic computations are challenging due to their complex nature. The main objectives of the research are summarized as follows: (i) We will investigate the development of new efficient algorithms and architectures for finite field arithmetic operations, such as multiplication, squaring, inversion, and exponentiation in binary extension fields using polynomial, shifted polynomial and Gaussian normal basis representations. We will consider their designs and implementations in ASICs and FPGAs. For each and every working platform, we plan to further optimize these operations for both lightweight and high-performance applications to have low-resource and/or high-speed computations. (ii) We will study the designs and implementations of a number of public and private key cryptosystems based on our newly proposed multipliers. Finite field multiplication is the main arithmetic operation used in elliptic curve and exponentiation-based cryptosystems, the AES-GCM authenticated encryption and the WG stream cipher. The effects of using different digit-level multipliers will be investigated to further optimize these cryptosystems for two-end applications namely, lightweight and high-performance cryptosystems. (iii) We will explore new reliable and robust schemes for private and public key cryptosystems to counteract natural faults and fault attacks. This research is very important due to the fact that fault attacks have become a serious concern in cryptographic applications. The research will be based on adopting efficient concurrent error control coding approaches with low overhead and acceptable error detection capability. This research will lead to more secure and reliable cryptosystems with lower cost and higher performance. It will also significantly contribute to training highly qualified personnel for academia and a large number of companies in the Canadian Information and Communications Technologies (ICT) sector.