On the security of a Williams based public key encryption scheme

DOI10.1007/3-540-44586-2_1MaRDI QIDQ2724619zbMATH OpenFDO

Authors Siguna Müller

Publication date 1 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44586-2_1

zbMATH Keywords

chosen ciphertextfactorization intractabilityoracle hashingplaintext awarenesspublic key cryptosystemsecuritysole-samplability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 5139182
• A new public-key cryptosystem as secure as factoring
• scientific article; zbMATH DE number 5005844
• A practical public key cryptosystem from Paillier and Rabin schemes
• Practical chosen ciphertext secure encryption from factoring

Cited in

(3)

• RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
• scientific article; zbMATH DE number 5139182 (Why is no real title available?)
• On the concealability of messages by the Williams public-key encryption scheme

This page was built for publication: On the security of a Williams based public key encryption scheme

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