QR code

New Jochemsz–May Cryptanalytic Bound for RSA System Utilizing Common Modulus <i>N</i> = <i>p</i><sup>2</sup><i>q</i>

This paper describes an attack on the Rivest, Shamir and Adleman (RSA) cryptosystem utilizing the modulus <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><msup><mi>p</mi><mn>2</mn></msup><mi>q</mi></mrow></semantics></math></inli...

Volledige beschrijving

Bewaard in:
Hoofdauteurs: Nurul Nur Hanisah Adenan, Muhammad Rezal Kamel Ariffin, Siti Hasana Sapar, Amir Hamzah Abd Ghafar, Muhammad Asyraf Asbullah
Formaat: Artigo
Taal:Inglês
Gepubliceerd in: MDPI AG 2021-02-01
Reeks:Mathematics
Onderwerpen:
factoring
least significant bits (LSBs)
most significant bits (MSBs)
multiplicative inverse
Jochemsz–May extended strategy
Online toegang:https://www.mdpi.com/2227-7390/9/4/340
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items