Niklas Gassner,Julia Lieb,Abhinaba Mazumder et al.
Niklas Gassner et al.
In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes as public keys. We then apply this framework to information set decodi...
Altan B Kılıç,Anne Nijsten,Ruud Pellikaan et al.
Altan B Kılıç et al.
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing throu...
New results on non-disjoint and classical strong external difference families [0.03%]
一类新型经典强外部差族的构造及判定准则
Sophie Huczynska,Sophie Hume
Sophie Huczynska
Classical strong external difference families (SEDFs) are much-studied combinatorial structures motivated by information security applications; it is conjectured that only one classical abelian SEDF exists with more than two sets. Recently,...
Federico Canale,María Naya-Plasencia
Federico Canale
GIFT-64 is a block cipher that has received a lot of attention from the community since its proposal in 2017. The attack on the highest number of rounds is a differential related-key attack on 26 rounds. We studied this attack, in particula...
Máté Gyarmati,Péter Ligeti,Peter Sziklai et al.
Máté Gyarmati et al.
Secret sharing is a general method for distributing sensitive data among the participants of a system such that only a collection of predefined qualified coalitions can recover the secret data. One of the most widely used special cases is t...
Robert Christian Subroto
Robert Christian Subroto
Circulant Column Parity Mixers (CCPMs) are a particular type of linear maps, used as the mixing layer in permutation-based cryptographic primitives like Keccak-f (SHA3) and Xoodoo. Although being successfully applied, not much is known rega...
CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist [0.03%]
基于类群作用的带扭部分盲签名方案
Shuichi Katsumata,Yi-Fu Lai,Jason T LeGrow et al.
Shuichi Katsumata et al.
In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. While at a high level the scheme resembles the Schnorr blind signature, our work does not directly follow from that construction, since ...
F R Kschischang,F Manganiello,A Ravagnani et al.
F R Kschischang et al.
We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the problem corresponds to an interference alignment problem over a fi...
Joanne Hall,Daniel Horsley,Douglas R Stinson
Joanne Hall
In situations where every item in a data set must be compared with every other item in the set, it may be desirable to store the data across a number of machines in such a way that any two data items are stored together on at least one mach...
Jan Schoone,Joan Daemen
Jan Schoone
The Boolean map χ n : F 2 n → F 2 n , x ↦ y defined by y i = x i + ( x i + 1 + 1 ) x i + 2 (where i ∈ Z / n Z ) is used in various permutations that are part of cryptographic schemes, e.g., Keccak-f (the SHA-...