Skip to main content
Book ChapterOPEN ACCESS

How easy is collision search? Application to DES

  • Quisquater J
  • Delescaille J
Springer Berlin Heidelberg, (2007), 429-434
DOI: 10.1007/3-540-46885-4_43
N/ACitations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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

Cite

CITATION STYLE

APA

Quisquater, J.-J., & Delescaille, J.-P. (2007). How easy is collision search? Application to DES. In Advances in Cryptology — EUROCRYPT ’89 (pp. 429–434). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-46885-4_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free