Large subsets of [Formula: see text] without arithmetic progressions [0.03%]
不含算术进展的[Formula: see text]的大型子集
Christian Elsholtz,Benjamin Klahn,Gabriel F Lipnik
Christian Elsholtz
For integers m and n, we study the problem of finding good lower bounds for the size of progression-free sets in ( Z m n , + ) . Let r k ( Z m n ) denote the maximal size of a subset of Z m n without arithmetic progressions of length k...
Jessica Bariffi,Sam Mattheus,Alessandro Neri et al.
Jessica Bariffi et al.
New constructions for moderate-density parity-check (MDPC) codes using finite geometry are proposed. We design a parity-check matrix for the main family of binary codes as the concatenation of two matrices: the incidence matrix between poin...
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis [0.03%]
基于常数模加法的位向量差分模型及其在差分和不可能差分密码分析中的应用
Seyyed Arash Azimi,Adrián Ranea,Mahmoud Salmasizadeh et al.
Seyyed Arash Azimi et al.
ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation, and XOR. To evaluate the resistance of an ARX cipher against differential and impossible-differential cryptanalysis, the recent automated methods empl...
Gianira N Alfarano,Julia Lieb,Joachim Rosenthal
Gianira N Alfarano
In this paper, a construction of ( n , k , δ ) LDPC convolutional codes over arbitrary finite fields, which generalizes the work of Robinson and Bernstein and the later work of Tong is provided. The sets of integers forming a (k, w)-(...
Kwangsu Lee,Minhye Seo
Kwangsu Lee
Functional encryption for set intersection (FE-SI) in the multi-client environment is that each client i encrypts a set X i associated with time T by using its own encryption key and uploads it to a cloud server, and then the cloud server ...
Julian Renner,Alessandro Neri,Sven Puchinger
Julian Renner
Low-rank parity-check (LRPC) codes are rank-metric codes over finite fields, which have been proposed by Gaborit et al. (Proceedings of the workshop on coding and cryptography WCC, vol 2013, 2013) for cryptographic applications. Inspired by...
Christian Elsholtz,Péter Pál Pach
Christian Elsholtz
We study progression-free sets in the abelian groups G = ( Z m n , + ) . Let r k ( Z m n ) denote the maximal size of a set S ⊂ Z m n that does not contain a proper arithmetic progression of length k. We give lower bound constru...
Anne Broadbent,Christian Schaffner
Anne Broadbent
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other app...
Thijs Laarhoven,Michele Mosca,Joop van de Pol
Thijs Laarhoven
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can ...
Remi Bricout,Sean Murphy,Kenneth G Paterson et al.
Remi Bricout et al.
We explore the use of the Mantin biases (Mantin, Eurocrypt 2005) to recover plaintexts from RC4-encrypted traffic. We provide a more fine-grained analysis of these biases than in Mantin's original work. We show that, in fact, the original a...