Document Zbl 0999.94546 - zbMATH Open
Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.
Fields
| any | anywhere |
| an | internal document identifier |
| au | author, editor |
| ai | internal author identifier |
| ti | title |
| la | language |
| so | source |
| ab | review, abstract |
| py | publication year |
| rv | reviewer |
| cc | MSC code |
| ut | uncontrolled term |
| dt | document type (j: journal article; b: book; a: book article) |
Operators
| a & b | logic and |
| a | b | logic or |
| !ab | logic not |
| abc* | right wildcard |
| "ab c" | phrase |
| (ab c) | parentheses |
See also our General Help.
On the interpolation attacks on block ciphers. (English) Zbl 0999.94546
Schneier, Bruce (ed.), Fast software encryption. 7th international workshop, FSE 2000, New York, NY, USA, April 10-12, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1978, 109-120 (2001).
Summary: The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and/or on the number of terms in the polynomial approximation expression. In some situations, the round function or the S-boxes of the block cipher are expressed explicitly in terms of algebraic functions, yet in many other instances the S-boxes are expressed in terms of their Boolean function representation. In this case, the cryptanalyst has to evaluate the algebraic description of the S-boxes or the round function using the Lagrange interpolation formula. A natural question is what is the effect of the choice of the irreducible polynomial used to construct the finite field on the degree of the resulting polynomial. Another question is whether or not there exists a simple linear transformation on the input or output bits of the S-boxes (or the round function) such that the resulting polynomial has a lesser degree or smaller number of non-zero coefficients. In this paper we give an answer to these questions. We also present an explicit relation between the Lagrange interpolation formula and the Galois field Fourier transform.
For the entire collection see [Zbl 0958.00037].
MSC:
| 94A60 | Cryptography |
| 94C10 | Switching theory, application of Boolean algebra; Boolean functions (MSC2010) |