Designs, Codes and Cryptography

CCA security for contracting (quasi-)Feistel constructions with tight round complexity

Chun Guo, Ling Song

PERK: compact signature scheme based on a new variant of the permuted kernel problem

Slim Bettaieb, Loïc Bidoux, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni, Marco Palumbi

Classification of semiregular relative difference sets with attaining Turyn’s bound

Ka Hin Leung, Bernhard Schmidt, Tao Zhang

Classifying pseudo-ovals, translation generalized quadrangles, and elation Laguerre planes of small order

• Open Access

Giusy Monzillo, Tim Penttila, Alessandro Siciliano

Preimage attacks on reduced-round Ascon-Xof

Seungjun Baek, Giyoon Kim, Jongsung Kim

Construction of quantum codes from multivariate polynomial rings

Cong Yu, Shixin Zhu, Fuyin Tian

Combinatorial constructions of optimal low-power error-correcting cooling codes

Shuangqing Liu, Lijun Ji

On the size distribution of the fixed-length Levenshtein balls with radius one

Geyang Wang, Qi Wang

Special overlarge sets of Kirkman triple systems

Juanjuan Xu, Lijun Ji

Ovoids of Q(6, q) of low degree

• Open Access

Daniele Bartoli, Nicola Durante, Giovanni Giuseppe Grimaldi

Jacobi polynomials for the first-order generalized Reed–Muller codes

• Open Access

Ryosuke Yamaguchi

New constructions of signed difference sets

Zhiwen He, Tingting Chen, Gennian Ge

Algebraic properties of the maps

• Open Access

Jan Schoone, Joan Daemen

Lengths of divisible codes: the missing cases

Sascha Kurz

Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding

• Open Access

Hannes Bartz, Sven Puchinger