Journal Article10.1109/TETC.2021.3073475
Efficient Word Size Modular Arithmetic
33
TL;DR: This work proposes a new modular multiplication designed to be computed on one word size only, which outperforms other existing solutions including generalist solutions like Montgomery's and Barrett's modular multiplication as well as classes of moduli like Mersenne, Pseudo-Mersenne and Montgomery-Friendly.
read more
Abstract: Modular multiplication is used in a wide range of applications. Most of the existing modular multiplication algorithms in the literature often focus on large size moduli. However, those large moduli oriented modular multiplication solutions are also used to implement modular arithmetic for applications requiring modular arithmetic on moduli of size inferior to a word size i.e., 32/64bits. As it happens, a large majority of applications are using word size modular arithmetic. In this work, we propose a new modular multiplication designed to be computed on one word size only. For word size moduli, in a large majority of instances, our solution outperforms other existing solutions including generalist solutions like Montgomery's and Barrett's modular multiplication as well as classes of moduli like Mersenne, Pseudo-Mersenne, Montgomery-Friendly and Generalized Mersenne.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms
TL;DR: In this article , the authors proposed a signature scheme based on the alternating trilinear form equivalence problem, which can be used for post-quantum digital signatures, especially in the postquantum cryptography context.
40
Improved Plantard Arithmetic for Lattice-based Cryptography
Junhao Huang,Jipeng Zhang,Haosong Zhao,Zhe Liu,Ray C. C. Cheung,Çetin Kaya Koç,Donglong Chen +6 more
TL;DR: The improved Plantard arithmetic not only inherits its aforementioned advantage but also accepts signed inputs, produces signed output, and enlarges its input range compared with the original design, which allows better lazy reduction strategies during the NTT/INTT implementation in current LBC schemes.
•Posted Content
Improved single-round secure multiplication using regenerating codes.
TL;DR: This paper provides the first complete C implementation and benchmarking of Latte, a promising HIBE scheme proposed by the United Kingdom The National Cyber Security Centre (NCSC) in 2017 and endorsed by European Telecommunications Standards Institute (ETSI).
Error-Correction Coding Using Polynomial Residue Number System
Igor A. Kalmykov,V. P. Pashintsev,K T Tyncherov,A. A. Olenev,N. Chistousov +4 more
TL;DR: The development of an algorithm for detecting and correcting errors in the code of the polynomial residue number system, which allows for performing this procedure based on modular operations that are effectively implemented in codes of PRNS, is an urgent task.
11
Journal Article
HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures
Jung Hee Cheon,Hyeongmin Choe,Julie Devevey,Tim Güneysu,Dongyeon Hong,Markus Krausz,Georg Land,Damien Stehlé +7 more
TL;DR: The Hyperball bimodal modulE rejecTion signAture schemE (HAETAE) as discussed by the authors is based on the Fiat-Shamir with Aborts paradigm.
9
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
•Book
Handbook of Applied Cryptography
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
15K
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems)
Ronald L. Rivest,Adi Shamir,Len Adelman +2 more
- 01 Jan 1977
TL;DR: In this paper, a message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q.
8.2K