Crashing Modulus Attack on Modular Squaring for Rabin Cryptosystem

Kaminaga, Masahiro; Yoshikawa, Hideki; Shikoda, Arimitsu; Suzuki, Toshinori

doi:10.1109/tdsc.2016.2602352

Cited by 4 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In all the versions of the Rabin cryptography algorithms stated in [11,14,15,19], the public key component ᶇ is shared publicly. Hence the hacker can crack the system very easily using the following two cryptanalysis methods:…”

Section: Cryptanalysismentioning

confidence: 99%

“…The work in [14] deals with deterministic aspects and identification problems of the Rabin cryptosystem during decryption. The paper [15] proposed a fault attack against the Rabin cryptosystem using a one-byte permutation on public key n. However, the above-discussed methods are either too complex or easy to crack. Some researchers turn to the modulus process to improve the Rabin cryptosystem.…”

mentioning

confidence: 99%

“…The decryption side of the Rabin cryptosystem proposed in [11,14,15,19] uses two prime factors as the key and uses the Chinese Reminder Theorem (CRT) to obtain the plaintext. In these approaches, the decryption procedure produces four possible plaintexts, of which only one will always be correct.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A Novel and Secure Fake-Modulus Based Rabin-Ӡ Cryptosystem

Ramesh,

Dodmane,

Shetty

et al. 2023

Cryptography

View full text Add to dashboard Cite

Electronic commerce(E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O(ɲ× τ) which is higher than Rabin-P (O(ɲ)) algorithms.

show abstract

Section: Cryptanalysismentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

A Novel and Secure Fake-Modulus Based Rabin-Ӡ Cryptosystem

Ramesh,

Dodmane,

Shetty

et al. 2023

Cryptography

View full text Add to dashboard Cite

show abstract

“…Masahiro Kaminaga, et al,. [9] discussed a fault attack technique on modular exponentiation during Rabin's encryption where a complicated situation arose in case of message reconstruction when message and public key were not relatively prime. They also provided a rigorous algorithm to handle message reconstruction.…”

Section: Decryption Step-3: Alice Solves the Quadratic Equation M 2 -mentioning

confidence: 99%

A mathematical model for ascertaining same ciphertext generated from distinct plaintext in Michael O. Rabin Cryptosystem

Biswas¹

2019

IJSER

View full text Add to dashboard Cite

Michael O. Rabin Cryptosystem can generate same ciphertext form different plaintext as well as multiple plaintext from single cyphertext. There are a number of techniues to reveal original plaintext. But none of them can seperate same cyphertext against each plaintext generated from modular reduction arithmetic. If question arises about how one can distinguish particular ciphertext against each plaintext, to answer those questions, I design a new mathematical model for identifying same ciphertext against each plaintext and it also facilitates message encryption and decryption. The proposed mathematical model constructiond based on quadratic root of quadratic residue, quadratic quotient, floor function and absolute value counting in order to identify the ciphertext against the plaintext. In particular. When same number of residues generated from multiple plaintext applying modular reduction arithmetic. The proposed crypto intensive technique uses symmetric key using Diffie-Hellman key exchange protocol. The advantage of proposed crypto intensive technique is intended receiver getting only one plainvalue distinguishing the ciphertext against the plaintext. The proposed crypto teachnique requires less time complexity and probabily secure against man-in-the-middle, chosen plaintext and cyphertext attack.

show abstract