The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function
From MaRDI portal
Publication:3541940
DOI10.1007/11863854_34zbMath1152.94442OpenAlexW1669583598MaRDI QIDQ3541940
Publication date: 27 November 2008
Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11863854_34
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Boolean functions (06E30)
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 ⋮ Linear Equation on Polynomial Single Cycle T-Functions
This page was built for publication: The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function