The algebraic normal form, linear complexity and k-error linear complexity of single-cycle t-function

Authors:
Wenying Zhang;Chuan-Kun Wu
Affiliations:
State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Year:
2006

Citing 4
Cited 1

A New Class of Invertible Mappings

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A new class of single cycle t-functions

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
A relationship between linear complexity and k-error linear complexity

IEEE Transactions on Information Theory
On the stability of 2n-periodic binary sequences

IEEE Transactions on Information Theory

Linear Equation on Polynomial Single Cycle T-Functions

Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study single-cycle T-functions which have important applications in new cryptographic algorithms. We present the algebraic normal form (ANF) of all single-cycle T-functions and the enumeration of single-cycle functions, which reveal many mysterious aspects of such functions. We also investigate the linear complexity and the k-error complexity of single-cycle T-functions when n=2t, the results also reflect the good stability of single-cycle T-functions.