Cryptography and Communications Journal Impact Factor & Information

Publisher: Springer Verlag

Journal description

Current impact factor: 0.83

Impact Factor Rankings

2015 Impact Factor Available summer 2016
2014 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
    • 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: 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: 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
  • 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.
    Cryptography and Communications 12/2015; 7(4). DOI:10.1007/s12095-015-0127-8
  • [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: 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: 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
  • Cryptography and Communications 10/2015; DOI:10.1007/s12095-015-0159-0
  • Cryptography and Communications 09/2015; DOI:10.1007/s12095-015-0157-2
  • [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
  • Cryptography and Communications 08/2015; DOI:10.1007/s12095-015-0153-6
  • Cryptography and Communications 07/2015; DOI:10.1007/s12095-015-0149-2
  • Cryptography and Communications 07/2015; DOI:10.1007/s12095-015-0150-9
  • Cryptography and Communications 07/2015; DOI:10.1007/s12095-015-0144-7
  • Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0146-5
  • Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0147-4
  • Cryptography and Communications 06/2015; DOI:10.1007/s12095-015-0141-x