Cryptology ePrint Archive: Report 2019/826

Modular Multiplication Algorithm Suitable For Low-Latency Circuit Implementations

Erdinç Öztürk

Abstract: Modular multiplication is one of the most compute-intensive arithmetic operations. Most public-key cryptosytems utilize modular multiplications of integers of various lengths, depending on security requirements. Efficient algorithms and implementations are required to realize a practical public-key cryptosystem. Different parameters, such as area, power and time, can be optimized for different implementation requirements. Low latency was not as important as high throughput requirement for modular multiplication implementations before. However, with recent work on Verifiable Delay Functions (VDFs), a necessity for lowest possible latency for modular multiplication implementations emerged. VDFs are designed to take a prescribed time to realize the underlying computation that can be publicly verified. VDF constructions are required to utilize inherently sequential arithmetic operations. Efficient VDF constructions have been proposed recently, based on time-lock puzzles constructed by Rivest, Shamir and Wagner. An exponentiation operation in an RSA group needs to be realized for these VDF constructions. For these VDF constructions to be practical, low-latency modular multiplication algorithms and implementations are required. In this paper, a modular multiplication algorithm suitable for low-latency circuit implementations is proposed and an FPGA-optimized variant of this algorithm is presented.

Category / Keywords: implementation / Verifiable Delay Function (VDF), Modular Multiplication, Reduction

Date: received 16 Jul 2019

Contact author: erdinco at sabanciuniv edu

Available format(s): PDF | BibTeX Citation

Version: 20190717:071929 (All versions of this report)

Short URL: ia.cr/2019/826


[ Cryptology ePrint archive ]