scientific article; zbMATH DE number 3977016

MaRDI QIDQ3743317zbMATH OpenFDO

Authors Oded Goldreich

Publication date 1985

zbMATH Keywords

combinatorial analysiscombinatorial boundscryptographic securitycryptologyleast significant bit of a messagepublic key cryptosystemsRSA scheme

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Communication, information (94A99)

Recommendations

• RSA-bits are 0.5 + ε secure
• Stronger security proofs for RSA and Rabin bits.
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• The security of all RSA and discrete log bits
• RSA and elliptic curve least significant bit security

Cited in

(7)

• On RSA moduli with almost half of the bits prescribed
• Statistical properties of short RSA distribution and their cryptographic applications
• RSA and elliptic curve least significant bit security
• RSA-bits are 0.5 + ε secure
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• RSA bits are .732 + secure
• Some combinatorial invariants related to a cryptosystem

This page was built for publication:

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