2014
DOI: 10.1007/s00200-014-0237-0
|View full text |Cite
|
Sign up to set email alerts
|

The Rabin cryptosystem revisited

Abstract: The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes. In particular, a deterministic scheme using quartic reciprocity is described that works for primes congruent 5 modulo 8, a case that was still open. Both theoretical and practical solutions are presented. The Rabin signature is also reconsidered and a deterministic padding mechanism is proposed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 21 publications
0
8
0
1
Order By: Relevance
“…Fungsi dasar algoritmanya mirip dengan fungsi dasar dari algoritma RSA. Yang membedakannya hanya komputasinya lebih sederhana dengan dibandingkan algoritma RSA [12]. Pada algoritma Rabin Public Key, proses pembangkitan kuncinya dilakukan sebagai berikut : 1.…”
Section: Rabin-public Keyunclassified
“…Fungsi dasar algoritmanya mirip dengan fungsi dasar dari algoritma RSA. Yang membedakannya hanya komputasinya lebih sederhana dengan dibandingkan algoritma RSA [12]. Pada algoritma Rabin Public Key, proses pembangkitan kuncinya dilakukan sebagai berikut : 1.…”
Section: Rabin-public Keyunclassified
“…The classic Rabin signature of a message m is a triple (m, U, S), where U is a padding factor (found either randomly [10] or deterministically as in [5]) such that the equation x 2 = mU is solvable, and S is one of its roots. Verification is performed by comparing mU with S 2 .…”
Section: Preliminariesmentioning
confidence: 99%
“…Let H(m) be written in the form H(m) = m 1 ψ 1 + m 2 ψ 2 , with m 1 = H(m) mod p and m 2 = H(m) mod q. The padding factor U can be chosen deterministically as in [5] as U =…”
Section: Blum Primesmentioning
confidence: 99%
See 1 more Smart Citation
“…solvable that is why the signature on m is the pair(17,15) 1.3 Diffie-Hellman Key exchange protocolThe first published public-key algorithm appeared in the seminal paper by Diffie and Hellman that defined publickey cryptography. It is generally referred to as Diffie-IJSER ISSN 2229-5518 IJSER © 2019 http://www.ijser.org…”
mentioning
confidence: 99%