S-boxes from binary quasi-cyclic codes. (English) Zbl 1429.94054
Kabatiansky, Grigory (ed.) et al., Algebraic and combinatorial coding theory – 2016. Selected papers from the 15th international workshop (ACCT-XV), Albena, Bulgaria, June 18–24, 2016. Amsterdam: Elsevier. Electron. Notes Discrete Math. 57, 67-72 (2017).
Summary: In this paper we present a construction for S-boxes using quasi-cyclic codes. We obtain S-boxes with good nonlinearity.
For the entire collection see [Zbl 1375.94013].
For the entire collection see [Zbl 1375.94013].
Software:
CUDAReferences:
| [2] | Bouyuklieva, S.; Bouyukliev, I., On the binary quasi-cyclic codes, (Proceedings of the Intern. Workshop OCRT. Proceedings of the Intern. Workshop OCRT, Albena, Bulgaria (2013)), 59-64 · Zbl 1433.94139 |
| [3] | Carlet, C., Boolean Functions for Cryptography and Error Correcting Codes, (Crama, Hammer, Boolean Models and Methods in Mathematics, Computer Science, and Engineering (2010), Cambridge University Press) · Zbl 1209.94035 |
| [4] | Carlet, C., Vectorial Boolean Functions for Cryptography, (Crama, Hammer, Boolean Models and Methods in Mathematics, Computer Science, and Engineering (2010), Cambridge University Press) · Zbl 1209.94036 |
| [5] | Hussain, I.; Shah, T.; Gondal, M. A.; Khan, W. A., Construction of Cryptographically Strong \(8 \times 8 S\)-boxes, World Applied Sciences Journal, 13, 2389-2395 (2011) |
| [6] | Ivanov, G.; Nikolov, N.; Nikova, S., Reversed genetic algorithms for generation of bijective S-boxes with good cryptographic properties, Cryptography and Communications, 8, 247-276 (2016) · Zbl 1338.94074 |
| [7] | CUDA C Programming Guide, Availaible on: |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
