Randomized coding of plaintext encryption scheme

DOI10.13328/J.CNKI.JOS.005048MaRDI QIDQ5368635zbMATH OpenFDO

Authors Shundong Li, Jiawei Dou, Lin-Ming Gong, Daoshun Wang

Publication date 20 October 2017

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.005048

zbMATH Keywords

standard modeladaptive chosen-ciphertext attackindistinguishable securityrandomized coding

Mathematics Subject Classification ID

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

Recommendations

• Strengthening Security of RSA-OAEP
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Instantiability of RSA-OAEP under chosen-plaintext attack
• scientific article; zbMATH DE number 1842495
• scientific article; zbMATH DE number 1088907

Cited in

(6)

• Efficient Encryption From Random Quasi-Cyclic Codes
• Solving XOR Plaintext Strings with the Viterbi Algorithm
• A random encoding method for secure data communication: An extension of sequential coding
• scientific article; zbMATH DE number 2169072 (Why is no real title available?)
• Structured encryption algorithm for text cryptography
• Rerandomizable RCCA Encryption

This page was built for publication: Randomized coding of plaintext encryption scheme

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