Paper 2016/1131
New construction of single cycle T-function families
Shiyi ZHANG, Yongjuan WANG, and Guangpu GAO
Abstract
The single cycle T-function is a particular permutation function with complex algebraic structures, maximum period and efficient implementation in software and hardware. In this paper, on the basis of existing methods, by using a class of single cycle T-functions that satisfy some certain conditions, we first present a new construction of single cycle T-function families. Unlike the previous approaches, this method can construct multiple single cycle T-functions at once. Then the mathematical proof of the feasibility is given. Next the numeration for the newly constructed single cycle T-functions is also investigated. Finally, this paper is end up with a discussion of the properties which these newly constructed functions preserve, such as linear complexity and stability (k-error complexity), as well as a comparison with previous construction methods.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MAJOR revision.
- Keywords
- cryptographypermutation functionsingle cycle T-functionnumerationlinear complexity
- Contact author(s)
- syzhang1352 @ 163 com
- History
- 2017-04-21: last of 3 revisions
- 2016-12-08: received
- See all versions
- Short URL
- https://ia.cr/2016/1131
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/1131,
author = {Shiyi ZHANG and Yongjuan WANG and Guangpu GAO},
title = {New construction of single cycle T-function families},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/1131},
year = {2016},
url = {https://eprint.iacr.org/2016/1131}
}
