Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://doi.org/10.1007/3-540-46885-4_43 below:

How easy is collision search? Application to DES

Given a cryptographic algorithm f (depending upon a fixed message m and a key k), a pair of keys with collision k ₁ and k ₂ (in short, a collision) are keys such that f(m, k ₁) = f(m, k ₂).

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

1. Robert Sedgewick, Thomas G. Szymanski and Andrew C. Yao, The complexity of finding cycles in periodic functions, SIAM J. Comput., vol. 11,2, pp. 376–390, 1982.

   Article  MATH  MathSciNet  Google Scholar 

2. Jean-Jacques Quisquater and Jean-Paul Delescaille, Other cycling tests for DES, Springer Verlag, Lecture notes in computer science 293, Advances in cryptology, Proceedings of CRYPTO’ 87, pp. 255–256.

   Google Scholar 

3. Burton Kaliski, Ronald Rivest and Alan Sherman, Is the Data Encryption Standard a group? (Results of cycling experiments on DES)?, J. Cryptology, vol. 1,198, pp. 3–36.

   Google Scholar 

Download references

1. Philips Research Laboratory Belgium, Avenue Albert Einstein, 4, B-1348, Louvain-la-Neuve, Belgium

   Jean-Jacques Quisquater & Jean-Paul Delescaille

1. Jean-Jacques Quisquater
2. Jean-Paul Delescaille

1. Philips Research Laboratory, Avenue Albert Einstein 4, B-1348, Louvain-la-Neuve, Belgium

   Jean-Jacques Quisquater

2. ESAT Laboratory, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium

   Joos Vandewalle

© 1990 Springer-Verlag Berlin Heidelberg

Quisquater, JJ., Delescaille, JP. (1990). How easy is collision search? Application to DES. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_43

• .RIS
• .ENW
• .BIB

• DOI: https://doi.org/10.1007/3-540-46885-4_43

• Published: 18 May 2001

• Publisher Name: Springer, Berlin, Heidelberg

• Print ISBN: 978-3-540-53433-4

• Online ISBN: 978-3-540-46885-1

• eBook Packages: Springer Book Archive

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4