Linear Equation on Polynomial Single Cycle T-Functions

DOI10.1007/978-3-540-79499-8_21zbMath1166.94326OpenAlexW1586151034MaRDI QIDQ3600339

JinSong Wang, Wen-Feng Qi

Publication date: 10 February 2009

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79499-8_21

zbMATH Keywords

polynomial functionpseudorandom generatorsingle cycle

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)

Related Items (4)

The autocorrelation properties of single cycle polynomial T-functions ⋮ New application methods for word-oriented cryptographic primitives ⋮ T-functions revisited: new criteria for bijectivity/transitivity ⋮ On properties of the Klimov–Shamir generator of pseudorandom numbers

Cites Work

• Unnamed Item
• Analysis of Designing Interleaved ZCZ Sequence Families
• The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function
• Linear Properties in T-Functions
• Fast Software Encryption
• Fast Software Encryption
• Selected Areas in Cryptography
• Permutation polynomials modulo \(2^w\)

This page was built for publication: Linear Equation on Polynomial Single Cycle T-Functions