Ayça Çeşmelioğlu,Wilfried Meidl
Ayça Çeşmelioğlu
Recently in Çeşmelioğlu, Meidl (Adv. Math. Commun., 18, 2024), the study of EA-equivalence and CCZ-equivalence for functions from V n ( p ) to the cyclic group Z p k has been initiated, where V n ( p ) denotes an n-dimensional vect...
Instantiating the Hash-then-evaluate paradigm: Strengthening PRFs, PCFs, and OPRFs [0.03%]
实例化“Hash-then-Evaluate”范式：增强伪随机函数、部分相关函数和 oblivious 概念随机函数
Chris Brzuska,Geoffroy Couteau,Christoph Egger et al.
Chris Brzuska et al.
We instantiate the hash-then-evaluate paradigm for pseudorandom functions (PRFs), PRF ( k , x ) : = wPRF ( k , RO ( x ) ) , which builds a PRF PRF from a weak PRF wPRF via a public pre-processing random oracle RO . In applications to secur...
Propagation properties of a non-linear mapping based on squaring in odd characteristic [0.03%]
奇特征下基于平方的非线性变换的传播性质分析
Joan Daemen,Daniël Kuijsters,Silvia Mella et al.
Joan Daemen et al.
Many modern cryptographic primitives for hashing and (authenticated) encryption make use of constructions that are instantiated with an iterated cryptographic permutation that operates on a fixed-width state consisting of an array of bits. ...
Differential and Linear properties of vectorial boolean functions based on chi [0.03%]
基于χ的向量化的布尔函数的线性与差分性质分析
Silvia Mella,Alireza Mehrdad,Joan Daemen
Silvia Mella
To evaluate the security of a cryptographic primitive, investigating its resistance against differential and linear cryptanalysis is required. Many modern cryptographic primitives repeatedly apply similar round functions alternated with the...
Çağdaş Çalık,Meltem Sönmez Turan,René Peralta
Çağdaş Çalık
Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fischer and Peralta (2...
Çağdaş Çalık,Meltem Sönmez Turan,René Peralta
Çağdaş Çalık
The multiplicative complexity of a Boolean function is the minimum number of two-input AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of a given fu...
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions [0.03%]
symmetric boolean函数乘法复杂度的上界
Luís T A N Brandão,Çağdaş Çalık,Meltem Sönmez Turan et al.
Luís T A N Brandão et al.
A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis {XOR, AND, NOT}. In this paper we study the MC ...
Joan Boyar,Magnus Gausdal Find,René Peralta
Joan Boyar
We present techniques to obtain small circuits which also have low depth. The techniques apply to typical cryptographic functions, as these are often specified over the field GF (2), and they produce circuits containing only AND, XOR and XN...
Wilfried Meidl,Ísabel Pirsic
Wilfried Meidl
Depending on the parity of n and the regularity of a bent function f from F p n to F p , f can be affine on a subspace of dimension at most n/2, (n - 1)/2 or n/2 - 1. We point out that many p-ary bent functions take on this bound, and...
Joan Boyar,Magnus Gausdal Find,René Peralta
Joan Boyar
A necessary condition for the security of cryptographic functions is to be "sufficiently distant" from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, nonlinearit...