A. Caranti, F. Dalla Volta, M. Sala
The group generated by the round functions of a block ciphers is a widely investigated problem. We identify a large class of block ciphers for which such group is easily guaranteed to be primitive. Our class includes the AES and the SERPENT.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a key-alternating block cipher are the translates of a linear subspace. Following up remarks of Paterson and Shamir, we exhibit a connection to truncated differential cryptanalysis. We also give a condition that guarantees that the group generated by the round functions of a key-alternating block cipher is primitive. This applies in particular to AES.
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimitive almost simple permutation groups which induce a 2-transitive action on a block system and for which a block stabiliser acts 2-transitively on the block. We also determine those imprimitive rank 3 pe…
Delandtsheer and Doyen bounded, in terms of the block size, the number of points of a point-imprimitive, block-transitive 2-design. To do this they introduced two integer parameters, m and n, now called Delandtsheer--Doyen parameters, linking the block size with the parameters of an associated imprimitivity system on points. We show that the Delandtsheer--Doyen parameters provide upper bounds on the permutation ranks of the groups induced on the imprimitivity system and on a class of the system. We explore extreme cases where these bounds are attained, give a new construction for a family of d…
Most modern block ciphers are built using components whose cryptographic strength is evaluated in terms of their resistance to attacks on the whole cipher. In particular, differential properties of vectorial Boolean functions are studied for the S-Boxes to thwart differential cryptanalysis. Little is known on similar properties to avoid trapdoors in the design of the block cipher. In this paper we present a form of trapdoors coming from alternative vector space structures, which we call hidden sums, and give a characterization on the Boolean function S-Box to avoid any such hidden sum. We also…
Using combinatorics and character theory, we determine the imprimitive faithful complex characters, i.e., the irreducible faithful complex characters which are induced from proper subgroups, of the Schur covers of the symmetric and alternating groups. Furthermore, for every imprimitive character we establish all its minimal block stabilizers. As a corollary, we also determine the monomial faithful characters of the Schur covers.
A graph $Γ$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $Γ$ with $V(Γ)$ admitting a nontrivial $G$-invariant partition $\mathcal{B}$ such that there is exactly one edge of $Γ$ between any two distinct blocks of $\mathcal{B}$. This is achieved by giving a classification of $(G, 2)$-point-transitive and $G$-block-transitive designs $\mathcal{D}$ together with $G$-orbits $Ω$ on the flag set of $\mathcal{D}$ such that $G_{σ, L}$ is transitive on $L \setmin…
Sometimes it is possible to embed an algebraic trapdoor into a block cipher. Building on previous research, in this paper we investigate an especially dangerous algebraic structure, which is called a hidden sum and which is related to some regular subgroups of the affine group. Mixing group theory arguments and cryptographic tools, we pass from characterizing our hidden sums to designing an efficient algorithm to perform the necessary preprocessing for the exploitation of the trapdoor.
In 1987, Huw Davies proved that, for a flag-transitive point-imprimitive $2$-$(v,k,λ)$ design, both the block-size $k$ and the number $v$ of points are bounded by functions of $λ$, but he did not make these bounds explicit. In this paper we derive explicit polynomial functions of $λ$ bounding $k$ and $v$. For $λ\leq 4$ we obtain a list of `numerically feasible' parameter sets $v, k, λ$ together with the number of parts and part-size of an invariant point-partition and the size of a nontrivial block-part intersection. Moreover from these parameter sets we determine all examples with fewer than …
A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps on a small vector space. We show that this cannot happen for the AES. More precisely, we prove that if the AES round transformations can be embedded into a linear cipher acting on a vector space, then this space is huge-dimensional and so this embedding is infeasible in practice. We present two elementary proofs.
Block-transitive designs with a poset of imprimitive partitions
本文研究了具有特定偏序集的块设计，通过广义wreath产品理论，给出了块传递2-设计的条件，并提供了多个偏序集的显式例子。
We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it generalizes that introduced by Paterson in 1999. Moreover, we discuss the fact that studying the group generated by the round functions of a block cipher may not be sufficient to guarantee security against these trapdoors for the cipher.
Intersection density of imprimitive groups of degree $pq$
本文研究次数为 $pq$ 且具有唯一 $q$-大小块系的非本原群交密度，利用块作用核与循环码刻画密度大于1的情形，并将拟本原情形归结为含 Alt(5) 或 PSL 群的几乎单群。
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the composition of different layers which provide confusion and diffusion, and key additions. The bijectivity of any encryption function, crucial in order to make the decryption possible, is guaranteed by the use of invertible layers or by the Feistel structure. In this work a new family of ciphers, called wave ciphers, is introduced. In wave ciphers, round functions feature wave functions, which are vectorial Boolean functions ob…
The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,λ)$ design $\mathcal{D}$ with $k\le 6$. We prove that if $G$ is point-primitive then $G$ is of affine or almost simple type. If $G$ is point-imprimitive then $\mathcal{D}$ is a $3$-$(16,6,λ)$ design with $λ\in\{4, 12, 16, 24, 28, 48, 56, 64, 84, 96, 112, 140\}$, and $rank(G)=3$.
Finding Blocks of Imprimitivity When There is a Small-Base Action on Blocks
本文针对在块系上具有小基作用的非本原置换群，扩展小基算法以寻找非本原块系，并借助新的基大小上界将时间复杂度改进为 O(n log^5 n)，同时提出筛选的新变体作为关键组件。
The algebraic structure of the group generated by the encryption functions of a block cipher depends on the key schedule algorithm used for generating the round keys. For such a reason, in general, studying this group does not appear to be an easy task. Previous works, focusing on the algebraic properties of groups associated to a cipher, have studied the group generated by the round functions of the cipher considering independent round keys. In this paper, we want to study the more realistic group generated by the encryption functions, where the key schedule satisfies certain requirements. In…
We provide a new property, called Non-Type-Preserving, for a mixing layer which guarantees protection against algebraic attacks based on the imprimitivity of the group generated by the round functions. Our main result is to present necessary and sufficient conditions on the structure of the binary matrix associated to the mixing layer, so that it has this property. Then we show how several families of linear maps are Non-Type-Preserving, including the mixing layers of AES, GOST and PRESENT. Finally we prove that the group generated by the round functions of an SPN cipher with addition modulo a…
One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can hold for a larger number of rounds of a block cipher. We have Generalised Linear Cryptanalysis (GLC) and Partitioning Cryptanalysis (PC). Due to double-exponential combinatorial explosion of the number of possible invariant properties systematic exploration is not possible and extremely few positive working examples of GLC are known. Our answer is to work with polynomial algebraic invariants which makes partitions more intelligible. We have developed a constructive al…
On finite permutation groups of rank three
本文研究有限非本原秩3置换群，针对块上诱导作用为仿射型的情形，依据块作用核将其分为四类，并完全分类一类半本那群、证明仿射情形下存在特殊p-群型正则正规子群。
Block-Transitive Automorphism Groups of $2$-$(v,5,λ)$ Designs
本文研究 $2$-$(v,5,λ)$ 设计的区传递自同构群，证明点非本原时 $v$ 限于 16、21、81，并分类 $v=16,21$ 的设计；点本原时群为仿射、几乎单或积型，并给出积型分类。
In symmetric cryptography, the round functions used as building blocks for iterated block ciphers are often obtained as the composition of different layers providing confusion and diffusion. The study of the conditions on such layers which make the group generated by the round functions of a block cipher a primitive group has been addressed in the past years, both in the case of Substitution Permutation Networks and Feistel Networks, giving to block cipher designers the receipt to avoid the imprimitivity attack. In this paper a similar study is proposed on the subject of the Lai-Massey scheme,…
We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field $\GF (p^k)$ ($p\geq 2$ a prime number) is not closed under functional composition. These conditions justify using a sequential multiple encryption to strengthen the AES (Rijndael block cipher with specific block sizes) in case AES became practically insecure. In Sparr and Wernsdorf (2008), R. Sparr and R. Wernsdorf provided conditions under which the group generated by the Rijndael-like round functions based on operations of the finite field …
Locally dihedral block designs and primitive groups with dihedral point stabilizers
本文研究了具有二面体点稳定子的原始群分类，并应用于点局部二面体块设计的分类，证明了对称设计中G_x和G_B在G中 conjugate，或G为奇数阶弗罗贝尼乌斯群。
The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario and we investigate some conditions which make such a construction immune to the partition-based attack introduced recently by Bannier et al.
Differential experiments using parallel alternative operations
本文将基于替代差分运算的攻击扩展至作用于分组每个s-box的并行替代运算，通过数学框架回顾与玩具密码实验，验证了其相较于XOR-差分攻击的有效性。
Binary bi-braces and applications to cryptography
该研究引入一类特殊brace以分析可在基于XOR的交替分组密码各层传播的新差分，给出其代数描述与自同构群计算方法，刻画了对应差分转移确定的XOR-线性置换，助力新型差分攻击研究。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。