Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A New Class of Invertible Mappings
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Cryptographic properties of nonlinear pseudorandom number generators
Designs, Codes and Cryptography
New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Advances in Ultralightweight Cryptography for Low-Cost RFID Tags: Gossamer Protocol
Information Security Applications
Cryptanalysis of the David-Prasad RFID ultralightweight authentication protocol
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Flaws on RFID grouping-proofs. Guidelines for future sound protocols
Journal of Network and Computer Applications
An optimal probabilistic solution for information confinement, privacy, and security in RFID systems
Journal of Network and Computer Applications
Linear cryptanalysis of the TSC family of stream ciphers
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Two algebraic attacks against the F-FCSRs using the IV mode
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Cryptanalysis of t-function-based hash functions
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Linear weaknesses in t-functions
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i n, bit i of any output word can depend only on bits 0,1,..., i of any input word. All the boolean operations and most of the numeric operations in modern processors are T-functions, and all their compositions are also T-functions. Our earlier papers on the subject dealt with “crazy” T-functions which are invertible mappings (including Latin squares and multipermutations) or single cycle permutations (which can be used as state update functions in stream ciphers). In this paper we use the theory of T-functions to construct new types of primitives, such as MDS mappings (which can be used as the diffusion layers in substitution/permutation block ciphers), and self-synchronizing hash functions (which can be used in self-synchronizing stream ciphers or in “fuzzy” string matching applications).