K-bent functions: From coding theory to cryptology Full article
| Source | 2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON 2008 Compilation, 2008. |
||||
|---|---|---|---|---|---|
| Output data | Year: 2008, Pages: 36-40 Pages count : 5 DOI: 10.1109/SIBIRCON.2008.4602613 | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
In this paper we would like to give a new example of the fact that ideas of coding theory sometimes find unexpected applications in cryptology. Our example is based on new notions of k-Walsh-Hadamard transform for a Boolean function and k-bent function (here k is integer, 1 ≤ k ≤ m/2, m is an even number of variables), which we introduce. These notions appeared at first as geometric images of coding theory. But soon they found applications in cryptanalysis. Using these notions we study special quadratic approximations in block ciphers and prove that by using k-bent functions in a cipher it is possible to make it resistant to these approximations.
Cite:
Токарева Н.Н.
K-bent functions: From coding theory to cryptology
In compilation 2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON 2008. 2008. – C.36-40. DOI: 10.1109/SIBIRCON.2008.4602613 Scopus OpenAlex
K-bent functions: From coding theory to cryptology
In compilation 2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON 2008. 2008. – C.36-40. DOI: 10.1109/SIBIRCON.2008.4602613 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-52949089269 |
| OpenAlex: | W2157226637 |