Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1411.7681

The role of Boolean functions in hiding sums as trapdoors for some block ciphers

Riccardo Aragona·Marco Calderini·Massimiliano Sala
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 study some properties of this new class of vectorial Boolean functions, which we call anti-crooked, and provide a toy cipher with a hidden sum trapdoor.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Riccardo Aragona, Marco Calderini, Massimiliano Sala. 2015-01-16. The role of Boolean functions in hiding sums as trapdoors for some block ciphers. https://arxiv.org/abs/1411.7681

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗