Designs, Codes and Cryptography
Publisher: Springer Nature · ISSN 0925-1022,1573-7586 · 429 articles
- Low-data cryptanalysis of LowMC instances with full S-box layers
- The exact parameters of a family of BCH codes
-
On the BUFF security of ECDSA with key recovery
Abstract In the usual syntax of digital signatures, the verification algorithm takes a verification key in addition to a signature and a message, whereas in ECDSA with key recovery, which is used in Ethereum, no verification key is...
- Automated differential–linear cryptanalysis of SIMON-like ciphers via truncated differential
- Anonymous reputation systems with revocation, revisited
- Hermitian hulls of rational algebraic geometry codes and applications in quantum codes
-
Regular fat linear sets
Abstract In this work, we introduce ( r , i )-regular fat linear sets, which are defined as linear sets containing exactly r points of weight i and all other points of weight one. This notion generalizes and unifies existing...
-
Using cyclic $$(f,\sigma )$$-codes over finite chain rings to construct $$\mathbb {Z}_p$$- and $$\mathbb {F}_q[\![t]\!]$$-lattices
Abstract We construct $$\mathbb {Z}_p$$ Z p -lattices and $$\mathbb {F}_q[\![t]\!]$$ F q [ [ t ] ] -lattices from cyclic $$(f,\sigma )$$ ( f , σ ) -codes over finite chain rings, employing quotients of natural nonassociative orders and...
- The odd and even sets of $$\textrm{PG}(2,8)$$, up to equivalence
- Linear and group identifying codes in Hamming graphs
- Generalized quadrangles with a point-primitive and line-primitive automorphism group with socle $$\textrm{PSp}_4(q)$$
- On $$\ell $$-rank additive intersection pairs (RAIP) of codes
- Subgroup perfect codes of simple N-groups
- Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights
- The weight spectrum of generalized Reed–Muller codes $$RM_q((m-2)(q-1)+3,m)$$
- Constructions of duadic codes with minimum weights exceeding the square-root lower bound
- Generalized hamming weights of almost-MDS codes with respect to twisted Reed–Solomon codes
-
Locally Recoverable Codes with availability from a family of fibered surfaces
Abstract We construct Locally Recoverable Codes (LRCs) with availability 2 from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques...
- Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3
- Incidence of lines, points and planes in PG(3, q) with respect to the twisted cubic
- Minimal 2n-covers of the hyperbolic quadric $$Q^+(4n+1,q)$$
- Soft planes and groups
- Tagged-FHE: strong syntax, stronger security, and standard model
- On the decoding error weight of one or two deletion channels
- Some results on Schur powers and cubes of primitive narrow-sense BCH codes
- Majority logic decoding of affine Grassmann codes over nonbinary fields
- Block-transitive 3-designs with small $$\lambda $$ on sporadic simple groups
-
A knapsack McEliece-based public key cryptosystem
Abstract A ROM IND-CCA2 Key Encapsulation Mechanism (KEM) supported by a Public Key Encryption (PKE) scheme based on the Weighted Modular Subset Sum Problem (WMSSP) is proposed. Concretely, it is proven that for certain sets of...
- Characterization of $$\ell $$-form plateaued functions via association schemes
- Linearized Polynomial Chinese Remainder codes