2019
DOI: 10.13069/jacodesmath.617232
|View full text |Cite
|
Sign up to set email alerts
|

Bijective S-boxes of different sizes obtained from quasi-cyclic codes

Abstract: The aim of this paper is to construct S-boxes of different sizes with good cryptographic properties. An algebraic construction for bijective S-boxes is described. It uses quasi-cyclic representations of the binary simplex code. Good S-boxes of sizes 4,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…there are 256 rows, 256 columns and one frame. Table 2 outlines secret [19] encryption keys that are preliminary values of the three chaotic maps engaged. The input image and its histogram are presented in fig.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…there are 256 rows, 256 columns and one frame. Table 2 outlines secret [19] encryption keys that are preliminary values of the three chaotic maps engaged. The input image and its histogram are presented in fig.…”
Section: Resultsmentioning
confidence: 99%
“…Ruisanchez et al [18] constructed S-boxes with high diffusion characteristics through a novel algorithm. Bikov et al [19] fabricated bijective S-boxes of varying sizes through the application of binary quasi-cyclic codes with good cryptographic properties.…”
Section: Introductionmentioning
confidence: 99%
“…For example, we used it to study bijective S-boxes with n ≤ 18 variables and good cryptographic properties which were derived from linear codes with quasi-cyclic structures in Ref. [13].…”
Section: Introductionmentioning
confidence: 99%
“…In [1], the author presents a good relation between Boolean functions and codes. Furthermore, in [2], the construction of bijective S-boxes from quasi-cyclic codes was shown. In 2005, Guillot [3] presented an extension of the Maiorana-McFarland method for building Boolean functions with good cryptographic properties.…”
Section: Introductionmentioning
confidence: 99%