Adaptive-attack norm for decorrelation and super-pseudorandomness

DOI10.1007/3-540-46513-8_4MaRDI QIDQ4949326zbMATH OpenFDO

Authors Serge Vaudenay

Publication date 8 May 2000

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

Full work available at URL https://doi.org/10.1007/3-540-46513-8_4

zbMATH Keywords

adaptive chosen plaintext attacksciphertext attackscryptographydecorrelation upper boundsPeanut constructionrandom product cipher

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• Resistance against adaptive plaintext-ciphertext iterated distinguishers
• Resistance against general iterated attacks
• Provable security for block ciphers by decorrelation
• Resistance against iterated attacks by decorrelation revisited

Cited in

(7)

• Simple permutations mix well
• Resistance against adaptive plaintext-ciphertext iterated distinguishers
• Resistance against iterated attacks by decorrelation revisited
• Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
• Revisiting iterated attacks in the context of decorrelation theory
• On the equivalence of uniform key agreement and sequential composition insecurity
• \textsf{MSX}: lightweight block ciphers for microcontrollers with high-assurance against differential and linear attacks

This page was built for publication: Adaptive-attack norm for decorrelation and super-pseudorandomness

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