Journal• ISSN: 1936-2447
Cryptography and Communications
Springer Science+Business Media
About: Cryptography and Communications is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Computer science & Boolean function. It has an ISSN identifier of 1936-2447. Over the lifetime, 626 publications have been published receiving 5699 citations. The journal is also known as: Discrete structures, boolean functions and sequences.
Topics: Computer science, Boolean function, Finite field, Block cipher, Biology
Journal Tools
Papers published on a yearly basis
Papers
TL;DR: This original work is based on the development of an algebraic link between Hadamard matrices and the cohomology of finite groups that was discovered fifteen years ago, and identifies cocyclic generalized Hadamards with particular "stars" in four other areas of mathematics and engineering: group cohomological structures, incidence structures, combinatorics, and signal correlation.
Abstract: In Hadamard Matrices and Their Applications, K. J. Horadam provides the first unified account of cocyclic Hadamard matrices and their applications in signal and data processing. This original work is based on the development of an algebraic link between Hadamard matrices and the cohomology of finite groups that was discovered fifteen years ago. The book translates physical applications into terms a pure mathematician will appreciate, and theoretical structures into ones an applied mathematician, computer scientist, or communications engineer can adapt and use. The first half of the book explains the state of our knowledge of Hadamard matrices and two important generalizations: matrices with group entries and multidimensional Hadamard arrays. It focuses on their applications in engineering and computer science, as signal transforms, spreading sequences, error-correcting codes, and cryptographic primitives. The book's second half presents the new results in cocyclic Hadamard matrices and their applications. Full expression of this theory has been realized only recently, in the Five-fold Constellation. This identifies cocyclic generalized Hadamard matrices with particular "stars" in four other areas of mathematics and engineering: group cohomology, incidence structures, combinatorics, and signal correlation. Pointing the way to possible new developments in a field ripe for further research, this book formulates and discusses ninety open questions.
604 citations
TL;DR: Based on a generic construction of linear codes from mappings and by employing weakly regular bent functions, a new class of linear p-ary codes with three weights given with its weight distribution is provided.
Abstract: We contribute to the knowledge of linear codes with few weights from special polynomials and functions. Substantial efforts (especially due to C. Ding) have been directed towards their study in the past few years. Such codes have several applications in secret sharing, authentication codes, association schemes and strongly regular graphs. Based on a generic construction of linear codes from mappings and by employing weakly regular bent functions, we provide a new class of linear p-ary codes with three weights given with its weight distribution. The class of codes presented in this paper is different from those known in literature.
123 citations
TL;DR: An infinite family of quadrinomial APN functions on GF(2n) where n is divisible by 3 but not 9 is presented, and the inequivalence proof which shows that these functions are new is discussed.
Abstract: We present an infinite family of quadrinomial APN functions on GF(2 n ) where n is divisible by 3 but not 9. The family contains inequivalent functions, obtained by setting some coefficients equal to 0. We also discuss the inequivalence proof (by computation) which shows that these functions are new.
97 citations
TL;DR: An infinite family of three-Lee-weight codes of dimension 2m, where m is singly-even, over the ring Fp+uFp, which meets the Griesmer bound with equality and an application to secret sharing schemes is given.
Abstract: We construct an infinite family of three-Lee-weight codes of dimension 2m, where m is singly-even, over the ring Fp+uFp$\mathbb {F}_{p}+u\mathbb {F}_{p}$ with u2=0. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. By Gray mapping, we obtain an infinite family of abelian p-ary three-weight codes. When m is odd, and pź3 (mod 4), we obtain an infinite family of two-weight codes which meets the Griesmer bound with equality. An application to secret sharing schemes is given.
75 citations
TL;DR: In this paper, a genetic algorithm working in a reversed way is proposed, which can rapidly and repeatedly generate a large number of strong bijective S-boxes of each dimension from (8 × 8) to (16 × 16).
Abstract: Often the S-boxes are the only nonlinear components in a block cipher and as such play an important role in ensuring its resistance to cryptanalysis. Cryptographic properties and constructions of S-boxes have been studied for many years. The most common techniques for constructing S-boxes are: algebraic constructions, pseudo-random generation and a variety of heuristic approaches. Among the latter are the genetic algorithms. In this paper, a genetic algorithm working in a reversed way is proposed. Using the algorithm we can rapidly and repeatedly generate a large number of strong bijective S-boxes of each dimension from (8 × 8) to (16 × 16), which have sub-optimal properties close to the ones of S-boxes based on finite field inversion, but have more complex algebraic structure and possess no linear redundancy.
73 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 7 |
| 2025 | 73 |
| 2024 | 79 |
| 2023 | 69 |
| 2022 | 79 |
| 2021 | 95 |