Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On the problem of finding linear approximations and cryptanalysis of Pomaranch Version 2

In English

Författare

Summary, in English

We give a simple algorithm that can find biased linear approximations of nonlinear building blocks. The algorithm is useful if the building block is relatively small and exhaustive search is possible. Instead of searching all possible linear relations individually, we show how the most biased relation can be found in just a few steps. As an example we show how we can find a biased relation in the output bits of the stream cipher Pomaranch Version 2, a tweaked variant of Pomaranch, resulting in both distinguishing and key recovery attacks. These attacks will break both the 128-bit variant and the 80-bit variant of the cipher with complexity faster than exhaustive key search.

Publiceringsår

2007

Språk

Engelska

Sidor

220-233

Publikation/Tidskrift/Serie

Selected Areas in Cryptography/Lecture notes in computer science)

Volym

4356

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • cryptanalysis
  • stream ciphers
  • Pomaranch
  • linear approximation

Conference name

13th International Workshop, SAC 2006

Conference date

2006-08-17 - 2006-08-18

Conference place

Montreal, Canada

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-74461-0