Designs, Codes and Cryptography

Towards a classification of permutation binomials of the form over

Yi Li, Xiutao Feng, Qiang Wang

Reduction for block-transitive t- designs

Haiyan Guan, Shenglin Zhou

An algebraic algorithm for breaking NTRU with multiple keys

Shi Bai, Hansraj Jangir, Tran Ngo, William Youmans

Functional commitments for arbitrary circuits of bounded sizes

Jinrui Sha, Shengli Liu, Shuai Han

Optimal locally repairable codes via punctured simplex codes

Yuan Gao, Weijun Fang, Jingke Xu, Dong Wang, Sihuang Hu

New distance bounds for quasi-cyclic codes

• Open Access

Ferruh Özbudak, Buket Özkaya

On Boolean functions derived from linear maps over and their application to secret sharing

Deepak Agrawal, Srinivasan Krishnaswamy, Smarajit Das

On the maximum size of ultrametric orthogonal sets over discrete valued fields

• Open Access

Noy Soffer Aranov, Angelot Behajaina

An algebraic approach to circulant column parity mixers

• Open Access

Robert Christian Subroto

On the construction of certain odd degree irreducible polynomials over finite fields

Melek Çil, Barış Bülent Kırlar

Time-based attribute-based proxy re-encryption with decryption key update

Feixiang Zhao, Jian Weng, Wenli Xie, Lin Hou, Ming Li

Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field

Simon Masson, Antonio Sanso, Zhenfei Zhang

Storage codes and recoverable systems on lines and grids

Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, Eitan Yaakobi

On the uniqueness of balanced complex orthogonal design

Yiwen Gao, Yuan Li, Haibin Kan

Minimal abundant packings and choosability with separation

Zoltán Füredi, Alexandr Kostochka, Mohit Kumbhat

Non-linear MRD codes from cones over exterior sets

• Open Access

Nicola Durante, Giovanni Giuseppe Grimaldi, Giovanni Longobardi

Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions

Bingsheng Shen, Tao Yu, Zhengchun Zhou, Yang Yang

Transitive path decompositions of Cartesian products of complete graphs

• Open Access

Ajani De Vas Gunasekara, Alice Devillers

Binary cyclic-gap constant weight codes with low-complexity encoding and decoding

• Open Access

Birenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau

Two classes of exceptional m-to-1 rational functions

Zhiguo Ding, Michael E. Zieve

Generalized cycle joining method and its application to the construction of long-period Galois NFSRs

Yingyin Pan, Jianghua Zhong, Dongdai Lin

A characterization of complex Hadamard matrices appearing in families of MUB triplets

• Open Access

Ákos K. Matszangosz, Ferenc Szöllősi

On Abelian one-dimensional hull codes in group algebras

Rong Luo, Mingliang Yan, Sihem Mesnager, Dongchun Han

Association schemes arising from non-weakly regular bent functions

Yadi Wei, Jiaxin Wang, Fang-Wei Fu

Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing

Kazuhiko Minematsu, Shingo Sato, Junji Shikata

A quantum-secure partial parallel MAC QPCBC

Shuping Mao, Tingting Guo, Peng Wang, Ruozhou Xu, Yuchao Chen, Lei Hu

Infinite families of 3-designs from special symmetric polynomials

Guangkui Xu, Xiwang Cao, Gaojun Luo, Huawei Wu

Efficient error-correcting codes for the HQC post-quantum cryptosystem

Carlos Aguilar-Melchor, Nicolas Aragon, Jean-Christophe Deneuville, Philippe Gaborit, Jérôme Lacan, Gilles Zémor

Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique

Shuyu Luo, Weiqiong Wang, Qi Zhang, Zhenjie Song

Truncated differential cryptanalysis: new insights and application to QARMAv1-n and QARMAv2-64

Zahra Ahmadian, Akram Khalesi, Dounia M’foukh, Hossein Moghimi, María Naya-Plasencia