Publication: The Rabin cryptosystem revisitet
The Rabin cryptosystem revisitet
Date
Date
Date
Citations
Elia, M., Piva, M., & Schipani, D. (2015). The Rabin cryptosystem revisitet. Applicable Algebra in Engineering, Communication and Computing, 26(3), 251–275. https://doi.org/10.1007/s00200-014-0237-0
Abstract
Abstract
Abstract
The Rabin scheme used in public-key cryptosystem is here revisited with a focus limited to a few specific open issues. In particular, message decryption requires one out of four roots of a quadratic equation in a residue ring to be chosen, and a longstanding problem is to identify unambiguously and deterministically the encrypted message at the decryption side by adding the minimum number of extra bits to the cipher-text. While the question has already been solved for pairs of primes of the type 4
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page Range
Page Range
Page Range
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Metrics
Downloads
Views
Citations
Elia, M., Piva, M., & Schipani, D. (2015). The Rabin cryptosystem revisitet. Applicable Algebra in Engineering, Communication and Computing, 26(3), 251–275. https://doi.org/10.1007/s00200-014-0237-0