Algebraic Attacks on Stream Ciphers with Gröbner Bases

Frederik Armknecht () and Gwenolé Ars ()
Additional contact information
Frederik Armknecht: Ruhr-Universität Bochum
Gwenolé Ars: Lycée Marie de Champagne

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 329-348 from Springer

Abstract: Abstract Stream ciphers efficiently encrypt data streams of arbitrary length and are widely deployed in practice, e.g., in mobile phones. Consequently, the development of new mechanisms to design and analyze stream ciphers is one of the major topics in modern cryptography. Algebraic attacks evaluate the security of certain stream ciphers by exploring the question how an attack could be performed by generating and solving appropriate systems of equations. In this text, we give an introduction to algebraic attacks and provide an overview on how and to what extent Gröbner bases are useful in this context.

Keywords: Boolean Function; Output Function; Stream Cipher; Simple Combiner; Algebraic Immunity (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_18

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().