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.

An Optimal Sampling Technique for Distinguishing Random S-boxes

In English

Författare

Redaktör

  • Pramod Viswanath

Summary, in English

The nonrandom behavior of the outputs of a random S-box can be exploited when constructing distinguishers for cryptographic primitives. Different methods of constructing samples from the outputs have been used in the literature. However, it has been unclear exactly how these methods differ and which method is optimal. We analyze four different sampling techniques. We prove that two of these sampling techniques result in dependent samples. We further show one sampling technique that is optimal in terms of error probabilities in the resulting distinguisher. However, this sampling technique is quite impractical as it requires very large storage. We further show a fourth sampling technique that is much more practical, and we prove that it is equivalent to the optimal one. We also show an improved algorithm for calculating the associated probability distributions that are required for the attack.

Publiceringsår

2012

Språk

Engelska

Sidor

846-850

Publikation/Tidskrift/Serie

Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on

Dokumenttyp

Konferensbidrag

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

ISIT 2012

Conference date

2012-07-01 - 2012-07-06

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 2157-8095
  • ISSN: 2157-8117
  • ISBN: 978-1-4673-2580-6 (Print)
  • ISBN: 978-1-4673-2578-3 (Online)