Decorrelation theory

{{Short description|Method of designing block ciphers}}

{{About|decorrelation in cryptography|decorrelation in general|Decorrelation}}

In cryptography, decorrelation theory is a system developed by Serge Vaudenay in 1998{{Cite book|title=Selected Areas in Cryptography: 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000. Proceedings|last=Stinson|first=Douglas|publisher=Springer Science+Business Media|year=2001|isbn=354042069X|location=Berlin|pages=57}} for designing block ciphers to be provably secure against differential cryptanalysis, linear cryptanalysis,{{Cite book|title=Information Security and Cryptology - ICISC'99: Second International Conference Seoul, Korea, December 9-10, 1999 Proceedings|last=Song|first=Joo Seok|publisher=Springer|year=2006|isbn=3540673806|location=Berlin|pages=1}} and even undiscovered cryptanalytic attacks meeting certain broad criteria. Ciphers designed using these principles include COCONUT98 and the AES candidate DFC, both of which have been shown to be vulnerable to some forms of cryptanalysis not covered by the theory.

According to Vaudenay, the decorrelation theory has four tasks: 1) the definition of a measurement for the decorrelation, which usually relies on a matrix norm; 2) the construction of simple primitive or "decorrelation module" with a quite good decorrelation; 3) the construction of cryptographic algorithms with decorrelation modules so that the primitive can be inherited by the algorithm; and, 4) proving that the decorrelation provides security against attacks.Serve Vaudenay (May 2003). "Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness," In Howard Heys and Carlisle Adams' Selected Areas in Cryptography: 6th Annual International Workshop, SAC'99 Kingston, Ontario, Canada, August 9-10, 1999 Proceedings. Berlin: Springer. pp. 49-61. {{ISBN|3540671854}}

References

  • {{cite conference

| author = Serge Vaudenay

| title = Provable Security for Block Ciphers by Decorrelation

| conference = 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS '98)

| pages = 249–275

| publisher = Springer-Verlag

| date = February 1998

| location = Paris

| url = http://lasecwww.epfl.ch/pub/lasec/doc/Vau98a.ps

| format = PostScript

| accessdate = 26 February 2007

| archive-date = 23 April 2007

| archive-url = https://web.archive.org/web/20070423225958/http://lasecwww.epfl.ch/pub/lasec/doc/Vau98a.ps

| url-status = dead

}}

  • {{cite conference

| author = Lars Knudsen and Vincent Rijmen

| title = On the Decorrelated Fast Cipher (DFC) and Its Theory

| conference = 6th International Workshop on Fast Software Encryption (FSE '99)

| pages = 81–94

| publisher = Springer-Verlag

| date = March 1999

| location = Rome

| url = http://www.cosic.esat.kuleuven.be/publications/article-367.ps

| format = PostScript

| accessdate = 26 February 2007 }}

  • {{cite conference

| author = Serge Vaudenay

| title = Resistance Against General Iterated Attacks

| conference = Advances in Cryptology — EUROCRYPT '99

| pages = 255–271

| publisher = Springer-Verlag

| date = May 1999

| location = Prague

| url = http://citeseer.ist.psu.edu/vaudenay98resistance.html

| format = PDF/PostScript

| accessdate = 21 August 2007 }}

  • {{cite journal

| author = Serge Vaudenay

| title = Decorrelation: A Theory for Block Cipher Security

| journal = Journal of Cryptology

| volume = 16

| issue = 4

| issn = 0933-2790

| pages = 249–286

| date = September 2003

| url = http://lasecwww.epfl.ch/pub/lasec/doc/Vau03b.pdf

| accessdate = 26 February 2007

| doi = 10.1007/s00145-003-0220-6

| archive-date = 21 February 2007

| archive-url = https://web.archive.org/web/20070221141935/http://lasecwww.epfl.ch/pub/lasec/doc/Vau03b.pdf

| url-status = dead

}}

{{reflist}}