scispace - formally typeset
Search or ask a question
JournalISSN: 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 & Mathematics. 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.


Papers
More filters
MonographDOI
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.

511 citations

Journal ArticleDOI
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.

98 citations

Journal ArticleDOI
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.

87 citations

Journal ArticleDOI
TL;DR: In this paper, a new attack on elliptic curve atomic implementations with input randomization is proposed, based on the collision correlation analysis and the so-called horizontal modus operandi.
Abstract: Elliptic curves based algorithms are nowadays widely spread among embedded systems. They indeed have the double advantage of providing efficient implementations with short certificates and of being relatively easy to secure against side-channel attacks. As a matter of fact, when an algorithm with constant execution flow is implemented together with randomization techniques, the obtained design usually thwarts classical side-channel attacks while keeping good performances. Recently, a new technique that makes randomization ineffective, has been successfully applied in the context of RSA implementations. This method, related to a so-called horizontal modus operandi, introduced by Walter in 2001, turns out to be very powerful since it only requires leakages on a single algorithm execution. In this paper, we combine such kind of techniques together with the collision correlation analysis, introduced at CHES 2010 by Moradi et al., to propose a new attack on elliptic curves atomic implementations (or unified formulas) with input randomization. We show how it may be applied against several state-of-the art implementations, including those of Chevallier-Mames et al., of Longa and of Giraud-Verneuil and also Bernstein and Lange for unified Edward's formulas. Finally, we provide simulation results for several sizes of elliptic curves on different hardware architectures. These results, which turn out to be the very first horizontal attacks on elliptic curves, open new perspectives in securing such implementations. Indeed, this paper shows that two of the main existing countermeasures for elliptic curve implementations become irrelevant when going from vertical to horizontal analysis.

71 citations

Journal ArticleDOI
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.

67 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
202336
202279
202194
202077
201983
201865