Cryptography and Communications

Publisher: Springer Verlag

Current impact factor: 0.83

Impact Factor Rankings

2016 Impact Factor Available summer 2017
2014 / 2015 Impact Factor 0.828
2013 Impact Factor 0.647

Additional details

5-year impact 0.82
Cited half-life 0.00
Immediacy index 0.12
Eigenfactor 0.00
Article influence 0.80
ISSN 1936-2447
OCLC 85825471
Material type Periodical, Internet resource
Document type Journal / Magazine / Newspaper, Internet Resource

Publisher details

Springer Verlag

  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author can archive a post-print version
  • Conditions
    • Author's pre-print on pre-print servers such as arXiv.org
    • Author's post-print on author's personal website immediately
    • Author's post-print on any open access repository after 12 months after publication
    • Publisher's version/PDF cannot be used
    • Published source must be acknowledged
    • Must link to publisher version
    • Set phrase to accompany link to published version (see policy)
    • Articles in some journals can be made Open Access on payment of additional charge
  • Classification
    green

Publications in this journal


  • No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. Separable codes can be used to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we first show an equivalent condition of a \(\overline {2}\)-SC (4,M,q), and then construct two infinite families of \(\overline {2}\)-SCs of length 4, one of which is asymptotically optimal.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: A new class of matrices is introduced for use in error control coding. This extends previous results on the class of Fibonacci error correcting codes. For a given integer p, a (p+1)×(p+1) binary matrix M p is given whose nonzero entries are located either on the superdiagonal or the last row of the matrix. The matrices \({M^{n}_{p}}\) and \(M^{-n}_{p}\), the nth power of M p and its inverse, are employed as the encoding and decoding matrices, respectively. It is shown that for sufficiently large n, independent of the message matrix M, relations exist among the elements of the encoded matrix \(E=M\times {M_{p}^{n}}\). These relations play a key role in the error detection and correction.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Permutations over \(\mathbb {F}_{2^{2k}}\) with low differential uniformity, high algebraic degree and high nonlinearity are of great cryptographic importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers with SPN (Substitution Permutation Network) structure. A well known example is that the S-box of the famous Advanced Encryption Standard (AES) is derived from the inverse function on \(\mathbb {F}_{2^{8}}\), which has been proved to be a differentially 4-uniform permutation with the optimal algebraic degree and known best nonlinearity. Recently, Zha et al. proposed two constructions of differentially 4-uniform permutations over \(\mathbb {F}_{2^{2k}}\), say G t and G s, t with T r(s −1) = 1, by applying affine transformations to the inverse function on some subfields of \(\mathbb {F}_{2^{2k}}\) (Zha et al. Finite Fields Appl. 25, 64–78, 2014). In this paper, we generalize their method by applying other types of EA (extended affine) equivalent transformations to the inverse function on some subfields of \(\mathbb {F}_{2^{2k}}\) and present two new constructions of differentially 4-uniform permutations, say F α and F β, α with T r(β −1) = 1. Furthermore, we prove that all the functions G t with different t are CCZ (Carlet-Charpin-Zinoviev) equivalent to our subclass F 0, while all the functions G s, t with different t are CCZ-equivalent to our subclass F s,0. In addition, both our two constructions give many new CCZ-inequivalent classes of such functions, as checked by computer in small numbers of variables. Moreover, all these newly constructed permutations are proved to have the optimal algebraic degree and high nonlinearity.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Complete weight distribution can be used to study authentication codes and the Walsh transform of monomial functions over finite fields. Also, the Hamming weight distribution of a code can be obtained from its complete weight distribution. In this paper, we investigate the complete weight distributions of two classes of cyclic codes. We explicitly present the complete weight enumerators of the cyclic codes. Particularly, we partly solve an open problem proposed in Luo and Feng (IEEE Trans. Inf. Theory 54(12), 5345–5353 (2008)).
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: For multi-output Boolean functions (also called S-boxes), various measures of nonlinearity have been widely discussed in the literature but many problems are left open in this topic. The purpose of this paper is to present a new approach to estimating the nonlinearity of S-boxes. A more fine-grained view on the notion of nonlinearity of S-boxes is presented and new connections to some linear codes are established. More precisely, we mainly study the nonlinearity indicator (denoted by \(\mathcal {N}_{\mathrm {v}}\)) for S-boxes from a coding theory point of view. Such a cryptographic parameter \(\mathcal {N}_{\mathrm {v}}\) is more related to best affine approximation attacks on stream ciphers. We establish a direct link between \(\mathcal {N}_{\mathrm {v}}\) and the minimum distance of the corresponding linear code. We exploit that connection to derive the first general lower bounds on \(\mathcal {N}_{\mathrm {v}}\) of non-affine functions from \(\mathbb {F}_{2^{n}}\) to \(\mathbb {F}_{2^{m}}\) for m dividing n. Furthermore, we show that \(\mathcal {N}_{\mathrm {v}}\) can be determined directly by the weight distribution of the corresponding linear code.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, linear codes with few weights have been constructed through defining sets. Results show that some optimal codes can be obtained if the defining sets were well chosen. In this paper, we investigate the linear codes constructed from the absolute trace function. It is shown that the constructed codes are binary linear codes with three weights. The dual codes of the proposed linear codes are also studied and proved to be optimal or almost optimal.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    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.
    No preview · Article · Jan 2016 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: The demand for more efficient ciphers is a likely to sharpen with new generation of products and applications. Previous cipher designs typically focused on optimizing only one of the two parameters - hardware size or speed, for a given security level. In this paper, we present a methodology for designing a class of stream ciphers which takes into account both parameters simultaneously. We combine the advantage of the Galois configuration of NLFSRs, short propagation delay, with the advantage of the Fibonacci configuration of NLFSRs, which can be analyzed formally. According to our analysis, the presented stream cipher Espresso is the fastest among the ciphers below 1500 GE, including Grain-128 and Trivium.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study negacyclic codes of length 2k over the ring \(R=\mathbb {Z}_{4}+u\mathbb {Z}_{4}\), u 2 = 0. We have obtained a mass formula for the number of negacyclic of length 2k over R. We have also determined the number of self-dual negacyclic codes of length 2k over R. This study has been further generalized to negacyclic codes of any even length using discrete Fourier transform approach over R. We have conducted an exhaustive search and obtained some new \(\mathbb {Z}_{4}\)-linear codes with good parameters.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Let m be a positive integer. We study the linear complexity profile and correlation measure of two interleaved m-ary sequences of length s and t, respectively. In the case that s ≥ 2t or s = t and m is prime we estimate the correlation measure in terms of the correlation measure of the first base sequence and the length of the second base sequence. In this case a relation by Brandstätter and Winterhof immediately implies a lower bound on the linear complexity profile of the interleaved sequence. If m is not a prime, under the same restrictions on s and t, the power correlation measure introduced by Chen and Winterhof takes the role of the correlation measure to obtain lower bounds on the linear complexity profile. Moreover, we show that these restrictions on s and t are necessary, and otherwise the (power) correlation measure can be close to st. However, introducing and estimating the (power) correlation measure with bounded lags we are able to get a lower bound on the linear complexity profile of the interleaved sequence.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: XCB is a tweakable enciphering scheme (TES) which was first proposed in 2004. The scheme was modified in 2007. We call these two versions of XCB as XCBv1 and XCBv2 respectively. XCBv2 was later proposed as a standard for encryption of sector oriented storage media in IEEE-std 1619.2 2010. There is no known proof of security for XCBv1 but the authors provided a concrete security bound for XCBv2 and a “proof” justifying the bound. In this paper we show that XCBv2 is not secure as a TES by showing an easy distinguishing attack on it. For XCBv2 to be secure, the message space should contain only messages whose lengths are multiples of the block length of the block cipher. Even for such restricted message spaces, the bound that the authors claim is not justified. We show this by pointing out some errors in the proof. For XCBv2 on full block messages, we provide a new security analysis. The resulting bound that can be proved is much worse than what has been claimed by the authors. Further, we provide the first concrete security bound for XCBv1, which holds for all message lengths. In terms of known security bounds, both XCBv1 and XCBv2 are worse compared to existing alternative TESs.
    Preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present q new asymptotically optimal families of doubly periodic arrays with ideal auto and cross correlation constraints, derived from the Moreno-Maric construction for frequency hopping applications. These new families possess the same properties that make the Moreno-Maric construction suitable for communications systems and digital watermarking, size (q + 1) x (q + 1), weight omega = q + 1, family size q - 2, and correlation 2, where q is a power of a prime. These new families are asymptotically optimal.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Domain extender for the ideal cipher was firstly studied by Coron et al. (TCC 2010). The construction given by them doubles the domain. To extend the domain by a factor of t > 2, recursively applying their extender requires using the cipher exponential times, i.e. \(\mathcal {O}(t^{log_{2}3})\) . In this paper, we describe an improved extender which extends the domain by a factor of t with \(\mathcal {O}(t)\) calls to underlying small-block blockciphers. This extender is based on a (2t − 1)-round generalized Feistel structure, and is actually a generalization of the proposal of Coron et al. We show it to be indifferentiable from an ideal cipher with tn-bit blocks. Additionally, for expansion factor t we give an attack to show that indifferentiability cannot be achieved in (2t − 2)-round case. Compared with the recursively applying strategy, the time complexity of this extender is competitive in some practical applications.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Viewing array convolution as a commutative and associative multiplication, we furnish the set of all m×n arrays with the structure of a \(\mathbb {C}\)-algebra. We show that this allows a very efficient description of array manipulations and constructions. This is demonstrated by translating the technical polynomial construction of the almost perfect arrays given by Arasu and de Launey to a concise algebraic description.
    No preview · Article · Dec 2015 · Cryptography and Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Tang et al. and Lim et al. presented ways to construct balanced quaternary sequences with even period and optimal autocorrelation value by inverse Gray-mapping of binary sequences with optimal autocorrelation value. In this article, we consider quaternary sequences constructed from binary Legendre or Hall’s sextic sequence by these methods. We derive the linear complexity of series of balanced quaternary sequences with optimal autocorrelation value over the finite ring of four elements.
    No preview · Article · Dec 2015 · Cryptography and Communications

  • No preview · Article · Nov 2015 · Cryptography and Communications