Efficient big integer multiplication and squaring algorithms for cryptographic applications

DOI10.1155/2014/107109zbMath1437.94068DBLPjournals/jam/JahaniSS14OpenAlexW2022328177WikidataQ59049379 ScholiaQ59049379MaRDI QIDQ2336123

Shahram Jahani, K. G. Subramanian, Azman Samsudin

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/107109

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoiding large squares in infinite binary words
• A low-complexity LUT-based squaring algorithm
• Fast multiplication of large numbers
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Modular Multiplication Without Trial Division
• New directions in cryptography
• Fast Multiple-Precision Evaluation of Elementary Functions
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Mersenne twister
• More on squaring and multiplying large integers

This page was built for publication: Efficient big integer multiplication and squaring algorithms for cryptographic applications