main-content

Designs, Codes and Cryptography OnlineFirst articles

20-01-2022

A generic method for investigating nonsingular Galois NFSRs

Let n be a positive integer. An n-stage Galois NFSR has n registers and each register is updated by a feedback function. Then a Galois NFSR is called nonsingular if every register generates (strictly) periodic sequences, i.e., no branch points. In …

20-01-2022

Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields

The original algorithm of D.V. Chudnovsky and G.V. Chudnovsky for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear with respect to the degree of the extension. Recently, Randriambololona …

19-01-2022

16-01-2022

Generic transformation from broadcast encryption to round-optimal deniable ring authentication

Deniable ring authentication enables a prover in some group (called a ring) to authenticate a message to a verifier using its secret key while at the same time allowing the prover to deny ever having interacted with the verifier. This primitive …