Title :
Two Characterizations of Crooked Functions
Author :
Godsil, Chris ; Roy, Aidan
Author_Institution :
Calgary Univ., Calgary
Abstract :
In this correspondence, we give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.
Keywords :
cryptography; error correction codes; graph theory; nonlinear functions; Preparata-like code minimum distance; crooked graph distance-regularity; crooked nonlinear function characterization; cryptography theory; error correcting code; Binary codes; Combinatorial mathematics; Cryptography; Galois fields; Information science; Kernel; Nonlinear equations; Parity check codes; Vectors; Almost perfect; Preparata code; crooked; distance-regular graph; error-correcting code; nonlinear function;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2007.913505
