Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art

Massimiliano Sala ()
Additional contact information
Massimiliano Sala: Univ. of Trento, Dept. of Mathematics

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

Abstract: Abstract Last century saw a number of landmark scientific contributions, solving long-standing problems and opening the path to entirely new subjects. We are interested in three (here listed in chronological order) of these: 1. Claude Shannon’s (Bell System Tech. J. 27:379–423, 623–656, 1948), 2. Claude Shannon’s (Bell System Tech. J. 28:656–715, 1949), 3. Bruno Buchberger’s (Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Innsbruck, 1965)

Keywords: Boolean Function; Linear Code; Block Cipher; Polynomial Ideal; Cyclic Code (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_1

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

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

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 ().