Cryptography and Communications Journal Impact Factor & Information

Publisher: Springer Verlag

Journal description

Current impact factor: 0.65

Impact Factor Rankings

2015 Impact Factor Available summer 2015
2013 / 2014 Impact Factor 0.647

Additional details

5-year impact 0.00
Cited half-life 0.00
Immediacy index 0.00
Eigenfactor 0.00
Article influence 0.00
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

  • [Show abstract] [Hide abstract]
    ABSTRACT: A logarithmic signature for a finite group G is a sequence [A 1,⋯ ,A s ] of subsets of G such that every element g∈G can be uniquely written in the form g=g 1⋯g s , where g i ∈A i , 1≤i≤s. The aim of this paper is proving the existence of an MLS for the Suzuki simple groups S z(22m+1), m>1, when 22m+1+2 m+1+1 or 22m+1−2 m+1+1 are primes. The existence of an MLS for untwisted group G 2(4) and the sporadic Suzuki group S u z are also proved. As a consequence of our results, we prove that the simple groups S z(27) S z(211) S z(219) S z(229) S z(247) S z(273) S z(279) S z(2113) S z(2151) S z(2157) S z(2163) S z(2167) S z(2239) S z(2241) S z(2283) S z(2353) S z(2367) S z(2379). have an MLS.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0129-6
  • [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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0131-z
  • [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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0127-8
  • [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)×(q+1), weight ω=q+1, family size q−2, and correlation 2, where q is a power of a prime. These new families are asymptotically optimal.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0122-0
  • [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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0128-7
  • [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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0130-0
  • [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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0123-z
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this article we present a broader theoretical framework useful in studying the properties of so-called generalized bent functions. We give the sufficient conditions (and in many cases also necessary) for generalized bent functions when these functions are represented as a linear combination of: generalized bent; Boolean bent; and a mixture of generalized bent and Boolean bent functions. These conditions are relatively easy to satisfy and by varying the variables that specify these linear combinations many different classes of generalized bent functions can be derived. In particular, based on these results, we provide some generic construction methods of these functions and demonstrate that some previous methods are just special cases of the results given in this article.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0126-9
  • [Show abstract] [Hide abstract]
    ABSTRACT: RC4 is one of the most popular stream ciphers that generates pseudorandom words from pseudorandom permutations. In this paper we identify new bias for RC4 and its variants RC4A and VMPC, which are designed in a similar paradigm. Naturally, these biases provide new distinguishers for the pseudo-random keystream generated from these algorithms. In particular, our result provides the strongest distinguisher against VMPC. Although RC4A is of less practical interest, a lot of protocols use VMPC.
    Cryptography and Communications 09/2015; 7(3). DOI:10.1007/s12095-014-0119-0
  • [Show abstract] [Hide abstract]
    ABSTRACT: Fix a field \(\mathbb {F}\) . The algebraic immunity over \(\mathbb {F}\) of boolean function f : {0, 1}n → {0, 1} is defined as the minimal degree of a nontrivial (multilinear) polynomial \(g(x) \in \mathbb {F}[x_{1}, \ldots , x_{n}]\) such that f(x) is a constant (either 0 or 1) for all x ∈ {0, 1}n satisfying g(x) = 0. Function f is called k r o b u s t i m m u n e if the algebraic immunity of f is always not less than k no matter how one changes the value of f(x) for k ≤ |x| ≤ n − k. For any field \(\mathbb {F}\) , any integers n, k ≥ 0, we characterize all k robust immune symmetric boolean functions in n variables. The proof is based on a known symmetrization technique and constructing a partition of nonnegative integers satisfying certain (in)equalities about p-adic distance, where p is the characteristic of the field \(\mathbb {F}\) .
    Cryptography and Communications 09/2015; 7(3). DOI:10.1007/s12095-014-0120-7
  • [Show abstract] [Hide abstract]
    ABSTRACT: The Walsh transform \(\widehat {Q}\) of a quadratic function \(Q:\mathbb {F}_{p^{n}}\rightarrow \mathbb {F}_{p}\) satisfies \(|\widehat {Q}| \in \{0,p^{\frac {n+s}{2}}\}\) for an integer 0 ≤ s ≤ n−1. We study quadratic functions given in trace form \(Q(x) = {{\text {Tr}_{\mathrm {n}}}}({\sum }_{i=0}^{k}a_{i}x^{p^{i}+1})\) with the restriction that \(a_{i} \in \mathbb {F}_{p},~ 0\leq i\leq k\). We determine the expected value for the parameter s for such quadratic functions from \(\mathbb {F}_{p^{n}}\) to \(\mathbb {F}_{p}\), for many classes of integers n. Our exact formulas confirm that on average the value of s is small, and hence the average nonlinearity of this class of quadratic functions is high when p = 2. We heavily use methods, recently developed by Meidl, Topuzoğlu and Meidl, Roy, Topuzoğlu in order to construct/enumerate such functions with prescribed s. In the first part of this paper we describe these methods in detail and summarize the counting results.
    Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0142-9
  • [Show abstract] [Hide abstract]
    ABSTRACT: Self-dual codes (Type I and Type II codes) play an important role in the construction of even unimodular lattices, and hence in the determination of Jacobi forms. In this paper, we construct Type I and Type II codes (of higher lengths) over the ring \(\mathbb {Z}_{2^{m}}\) of integers modulo 2 m from shadows of Type I codes over \(\mathbb {Z}_{2^{m}}\), and obtain their complete weight enumerators. As an application, we determine some Jacobi forms on the modular group \({\Gamma }(1) = SL(2,\mathbb {Z})\). Besides this, we construct self-dual codes (of higher lengths) over \(\mathbb {Z}_{2^{m}}\) from the generalized shadow of a self-dual code \(\mathcal {C}\) of length n over \(\mathbb {Z}_{2^{m}}\) with respect to a vector \(s \in \mathbb {Z}_{2^{m}}^{n} \setminus \mathcal {C}\) satisfying either s ⋅ s ≡ 0 (mod 2 m ) or s ⋅ s ≡ 2 m−1 (mod 2 m ). We also illustrate our results with some examples.
    Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0139-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem in the skew polynomial ring, which leads to a canonical decomposition of skew GQC codes. We also focus on some characteristics of skew GQC codes in details. For a 1-generator skew GQC code, we define the parity-check polynomial, determine the dimension and give a lower bound on the minimum Hamming distance. The skew QC codes are also discussed briefly.
    Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0140-y
  • [Show abstract] [Hide abstract]
    ABSTRACT: Let 𝔽p be a finite field with p elements, where p is a prime. Let N ≥ 2 be an integer and f the least positive integer satisfying p f ≡ −1 (mod N). Then we let q = p 2f and r = q m . In this paper, we study the Walsh transform of the monomial function \(f(x)=\text {Tr}_{r/p}(ax^{\frac {r-1} N})\) for \(a \in \Bbb F_{r}^{*}\) . We shall present the value distribution of the Walsh transform of f(x) and show that it takes at most \(\min \{p, N\}+1\) distinct values. In particular, we can obtain binary functions with three-valued Walsh transform and ternary functions with three-valued or four-valued Walsh transform. Furthermore, we present two classes of four-weight binary cyclic codes and six-weight ternary cyclic codes.
    Cryptography and Communications 06/2015; 7(2). DOI:10.1007/s12095-014-0109-2
  • [Show abstract] [Hide abstract]
    ABSTRACT: MDS matrices incorporate diffusion layers in block ciphers and hash functions. MDS matrices are in general not sparse and have a large description and thus induce costly implementations both in hardware and software. It is also nontrivial to find MDS matrices which could be used in lightweight cryptography. In the AES MixColumn operation, a circulant MDS matrix is used which is efficient as its elements are of low hamming weights, but no general constructions and study of MDS matrices from d×d circulant matrices for arbitrary d is available in the literature. In a SAC 2004 paper, Junod et al. constructed a new class of efficient matrices whose submatrices were circulant matrices and they coined the term circulating-like matrices for these new class of matrices. We call these matrices as Type-I circulant-like matrices. In this paper we introduce a new type of circulant-like matrices which are involutory by construction and we call them Type-II circulant-like matrices. We study the MDS properties of d×d circulant, Type-I and Type-II circulant-like matrices and construct new and efficient MDS matrices which are suitable for lightweight cryptography for d up to 8. We also consider orthogonal and involutory properties of such matrices and study the construction of efficient MDS matrices whose inverses are also efficient. We explore some interesting and useful properties of circulant, Type-I and Type-II circulant-like matrices which are prevalent in many parts of mathematics and computer science.
    Cryptography and Communications 06/2015; 7(2). DOI:10.1007/s12095-014-0116-3
  • [Show abstract] [Hide abstract]
    ABSTRACT: Constacyclic codes form an interesting family of error-correcting codes due to their rich algebraic structure, and are generalizations of cyclic and negacyclic codes. In this paper, we classify repeated-root constacyclic codes of length ℓ t p s over the finite field \(\mathbb {F}_{p^{m}}\) containing p m elements, where ℓ ≡ 1(mod 2), p are distinct primes and t, s, m are positive integers. Based upon this classification, we explicitly determine the algebraic structure of all repeated-root constacyclic codes of length ℓ t p s over \(\mathbb {F}_{p^{m}}\) and their dual codes in terms of generator polynomials. We also observe that self-dual cyclic (negacyclic) codes of length ℓ t p s over \(\mathbb {F}_{p^{m}}\) exist only when p = 2 and list all self-dual cyclic (negacyclic) codes of length ℓ t 2s over \(\mathbb {F}_{2^{m}}\) . We also determine all self-orthogonal cyclic and negacyclic codes of length ℓ t p s over \(\mathbb {F}_{p^{m}}\) . To illustrate our results, we determine all constacyclic codes of length 175 over \(\mathbb {F}_{5}\) and all constacyclic codes of lengths 147 and 3087 over \(\mathbb {F}_{7}\) .
    Cryptography and Communications 06/2015; 7(2). DOI:10.1007/s12095-014-0106-5
  • [Show abstract] [Hide abstract]
    ABSTRACT: Orthogonal multi-arrays were first formulated by Brickell in investigation of authentication codes. In this article, we will prove that t-fold perfect splitting authentication codes with equal deception probabilities can be characterized in terms of orthogonal multi-arrays. We will also investigate the existence of orthogonal multi-arrays, and show that the existence of orthogonal multi-arrays OMA (t,k×c,n)s is equivalent to the existence of transversal splitting t-designs splitting TD (t,k×c,n)s. Further, we obtain some new infinite classes of t-fold perfect splitting authentication codes with equal deception probabilities.
    Cryptography and Communications 06/2015; 7(2). DOI:10.1007/s12095-014-0107-4
  • [Show abstract] [Hide abstract]
    ABSTRACT: Many modern ciphers have a substitution-permutation (SP) network as a main component. This design is well researched in relation to Advanced Encryption Standard (AES). One of the ways to improve the security of cryptographic primitives is the use of additional nonlinear layers. However, this replacement may not have any effect against particular cryptanalytic attacks. In this paper we use algebraic attacks to analyze an SP network with addition modulo 2 n as the key mixing layer. In particular, we show how to reduce the number of intermediate variables in round functions based on SP networks. We also apply the proposed method to the GOST 28147-89 block cipher that allows us to break reduced 8- and 14-round versions with complexity at most 2155 and 2215.4, respectively.
    Cryptography and Communications 05/2015; DOI:10.1007/s12095-015-0136-7