Efficient methods to overcome Rabin cryptosystem decryption failure

MaRDI QIDQ5217783zbMATH OpenFDO

Authors

Publication date 26 February 2020

Full work available at URL http://einspem.upm.edu.my/journal/fullpaper/vol11sapril/2.%20Zahari.pdf

zbMATH Keywords

equivalent to factorizationRabin cryptosystemunique decryption

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Recommendations

• The Rabin cryptosystem revisited
• scientific article; zbMATH DE number 2169072
• scientific article; zbMATH DE number 1088229
• Enhanced Rabin cryptosystem based on cubic congruence equation
• Provably secure Rabin-p cryptosystem in hybrid setting

Cited in

(4)

• Enhanced NTRU cryptosystem eliminating decryption failures
• scientific article; zbMATH DE number 2169072 (Why is no real title available?)
• Failing gracefully: decryption failures and the Fujisaki-Okamoto transform
• One-way homomorphic encryption: a composite group approach

This page was built for publication: Efficient methods to overcome Rabin cryptosystem decryption failure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217783)