New cryptographic primitives based on multiword T-functions
From MaRDI portal
Recommendations
Cited in
(18)- Cryptographic properties of nonlinear pseudorandom number generators
- New constructions of T-function
- T-functions revisited: new criteria for bijectivity/transitivity
- Left invertibility, flatness and identifiability of switched linear dynamical systems: a framework for cryptographic applications
- Non-archimedean theory of \(T\)-functions
- Linear Equation on Polynomial Single Cycle T-Functions
- New application methods for word-oriented cryptographic primitives
- [[:Publication:413547|Ergodic theory over \(\mathbb F_2 T\)]]
- A new class of invertible mappings
- Fast evaluation of T-functions via time-memory trade-offs
- The \(p\)-adic theory of automata functions
- Differential Cryptanalysis of T-Function Based Stream Cipher TSC-4
- Time-memory trade-off attacks on multiplications and T-functions
- Fast Software Encryption
- Fast Software Encryption
- Progress in Cryptology – Mycrypt 2005
- Cryptographic applications of T-functions
- Two classes of sequences derived from single cycle T-functions
This page was built for publication: New cryptographic primitives based on multiword T-functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713902)