Dial C for Cipher

DOI10.1007/978-3-540-74462-7_7MaRDI QIDQ5429153zbMATH OpenOpenAlexFDO

Authors Thomas Baignères, Matthieu Finiasz

Publication date 29 November 2007

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74462-7_7

zbMATH Keywords

AESBlock CipherBlum-Blum-Shub generatordecorrelationprovable security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4035722
• CS-Cipher
• The perfect cipher
• Codes, not ciphers
• Cryptanalysis of C2
• Reflection ciphers
• Equivocations for Homophonic Ciphers

Cited in

(10)

• Security evaluation of MISTY structure with SPN round function
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• Mathematical analysis for a dynamic cipher
• Provable secure scalable block ciphers.
• Building Secure Block Ciphers on Generic Attacks Assumptions
• Revisiting iterated attacks in the context of decorrelation theory
• Two practical and provably secure block ciphers: BEAR and LION
• Linear Cryptanalysis of Non Binary Ciphers
• FAST: secure and high performance format-preserving encryption and tokenization
• \textsf{MSX}: lightweight block ciphers for microcontrollers with high-assurance against differential and linear attacks

This page was built for publication: Dial C for Cipher

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