scientific article; zbMATH DE number 7422072

zbMath1476.94029MaRDI QIDQ5163746

Mohammad Ali Pourmina, Alireza Zolghadrasli, Mahnaz Mohammadi

Publication date: 8 November 2021

Full work available at URL: https://www.ijmex.com/index.php/ijmex/article/view/607

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

public-key cryptographyprime numbersRSA cryptosystemBarret modular exponentiationMontgomery modular exponentiation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• Breaking RSA may be as difficult as factoring
• An algebraic framework for Diffie-Hellman assumptions
• Short signatures from Diffie-Hellman: realizing almost compact public key
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptographic Hardware and Embedded Systems - CHES 2004

This page was built for publication: