Abstract
A T-function is a mapping in which the i-th bit of the output can depend only on bits 0,1,...,i of the input. All the bitwise machine operations and most of the numeric machine operations in modern processors are T-functions, and their compositions are also T-functions. In this paper we show that T-functions can be used to construct exceptionally efficient cryptographic building blocks which can be used as nonlinear maximal length state transition functions in stream ciphers, as large S-boxes in block ciphers, and as non-algebraic multipermutations in hash functions. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Klimov, A., & Shamir, A. (2004). Cryptographic applications of T-functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3006, 248–261. https://doi.org/10.1007/978-3-540-24654-1_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.