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.

A new algorithm for finding low-weight polynomial multiples and its application to TCHo

In English

Författare

Redaktör

  • Lilya Budaghyan
  • Tor Helleseth
  • Matthew G. Parker

Summary, in English

In this paper we present an algorithm for finding low-weight multiples of

polynomials over the binary field using coding theoretic methods. The code defined

by the public polynomial is cyclic, allowing an attacker to search for any shift of the

sought codeword. Therefore, a code with higher length and dimension is used, having

a larger number of low-weight codewords. Additionally, since the degree of the sought

polynomial is known, the sought codewords of weight w are transformed by a linear

mapping into codewords of weight w-2. Applying an algorithm for finding low-weight

codewords on the constructed code yields complexity for a key-recovery attack against

TCHo that is lower than previously expected.

Publiceringsår

2013

Språk

Engelska

Publikation/Tidskrift/Serie

Preproceedings The International Workshop on Coding and Cryptography WCC 2013

Dokumenttyp

Konferensbidrag

Förlag

The Selmer Center at the University of Bergen

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • Low-weight polynomial multiple
  • low-weight codeword
  • information-set decoding
  • public-key cryptography
  • TCHo

Conference name

International Workshop on Coding and Cryptography, WCC 2013

Conference date

2013-04-15 - 2013-04-19

Conference place

Bergen, Norway

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 978-82-308-2269-2