for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> MATHEMATICS (Total: 909 journals)
    - APPLIED MATHEMATICS (75 journals)
    - GEOMETRY AND TOPOLOGY (20 journals)
    - MATHEMATICS (676 journals)
    - MATHEMATICS (GENERAL) (41 journals)
    - NUMERICAL ANALYSIS (19 journals)
    - PROBABILITIES AND MATH STATISTICS (78 journals)

MATHEMATICS (676 journals)                  1 2 3 4 | Last

Showing 1 - 200 of 538 Journals sorted alphabetically
Abakós     Open Access   (Followers: 4)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 3)
Academic Voices : A Multidisciplinary Journal     Open Access   (Followers: 2)
Accounting Perspectives     Full-text available via subscription   (Followers: 7)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 16)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 4)
ACM Transactions on Mathematical Software (TOMS)     Hybrid Journal   (Followers: 6)
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 25)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1)
Acta Mathematica     Hybrid Journal   (Followers: 11)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2)
Acta Mathematica Scientia     Full-text available via subscription   (Followers: 5)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 6)
Acta Mathematica Vietnamica     Hybrid Journal  
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal  
Advanced Science Letters     Full-text available via subscription   (Followers: 9)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 3)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Complex Systems     Hybrid Journal   (Followers: 7)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 15)
Advances in Decision Sciences     Open Access   (Followers: 5)
Advances in Difference Equations     Open Access   (Followers: 2)
Advances in Fixed Point Theory     Open Access   (Followers: 5)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 11)
Advances in Linear Algebra & Matrix Theory     Open Access   (Followers: 2)
Advances in Materials Sciences     Open Access   (Followers: 16)
Advances in Mathematical Physics     Open Access   (Followers: 5)
Advances in Mathematics     Full-text available via subscription   (Followers: 10)
Advances in Numerical Analysis     Open Access   (Followers: 4)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Pure and Applied Mathematics     Hybrid Journal   (Followers: 6)
Advances in Pure Mathematics     Open Access   (Followers: 4)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2)
African Journal of Educational Studies in Mathematics and Sciences     Full-text available via subscription   (Followers: 5)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
Afrika Matematika     Hybrid Journal   (Followers: 1)
Air, Soil & Water Research     Open Access   (Followers: 9)
AKSIOMA Journal of Mathematics Education     Open Access   (Followers: 1)
Al-Jabar : Jurnal Pendidikan Matematika     Open Access  
Algebra and Logic     Hybrid Journal   (Followers: 4)
Algebra Colloquium     Hybrid Journal   (Followers: 4)
Algebra Universalis     Hybrid Journal   (Followers: 2)
Algorithmic Operations Research     Full-text available via subscription   (Followers: 5)
Algorithms     Open Access   (Followers: 11)
Algorithms Research     Open Access   (Followers: 1)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 4)
American Journal of Mathematical Analysis     Open Access  
American Journal of Mathematics     Full-text available via subscription   (Followers: 7)
American Journal of Operations Research     Open Access   (Followers: 5)
American Mathematical Monthly     Full-text available via subscription   (Followers: 6)
An International Journal of Optimization and Control: Theories & Applications     Open Access   (Followers: 7)
Analele Universitatii Ovidius Constanta - Seria Matematica     Open Access   (Followers: 1)
Analysis     Hybrid Journal   (Followers: 2)
Analysis and Applications     Hybrid Journal   (Followers: 1)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 3)
Analysis Mathematica     Full-text available via subscription  
Annales Mathematicae Silesianae     Open Access  
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4)
Annales UMCS, Mathematica     Open Access   (Followers: 1)
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica     Open Access  
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 11)
Annals of Discrete Mathematics     Full-text available via subscription   (Followers: 6)
Annals of Mathematics     Full-text available via subscription  
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 8)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of the Alexandru Ioan Cuza University - Mathematics     Open Access  
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1)
Annals of West University of Timisoara - Mathematics     Open Access  
Annuaire du Collège de France     Open Access   (Followers: 5)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applications of Mathematics     Hybrid Journal   (Followers: 1)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Mathematics     Open Access   (Followers: 3)
Applied Mathematics     Open Access   (Followers: 5)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 4)
Applied Mathematics - A Journal of Chinese Universities     Hybrid Journal  
Applied Mathematics Letters     Full-text available via subscription   (Followers: 1)
Applied Mathematics Research eXpress     Hybrid Journal   (Followers: 1)
Applied Network Science     Open Access   (Followers: 1)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5)
Arab Journal of Mathematical Sciences     Open Access   (Followers: 3)
Arabian Journal of Mathematics     Open Access   (Followers: 2)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 1)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5)
Archive of Numerical Software     Open Access  
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Arkiv för Matematik     Hybrid Journal   (Followers: 1)
Arnold Mathematical Journal     Hybrid Journal   (Followers: 1)
Artificial Satellites : The Journal of Space Research Centre of Polish Academy of Sciences     Open Access   (Followers: 21)
Asia-Pacific Journal of Operational Research     Hybrid Journal   (Followers: 3)
Asian Journal of Algebra     Open Access   (Followers: 1)
Asian Journal of Current Engineering & Maths     Open Access  
Asian-European Journal of Mathematics     Hybrid Journal   (Followers: 2)
Australian Mathematics Teacher, The     Full-text available via subscription   (Followers: 7)
Australian Primary Mathematics Classroom     Full-text available via subscription   (Followers: 3)
Australian Senior Mathematics Journal     Full-text available via subscription   (Followers: 1)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Axioms     Open Access   (Followers: 1)
Baltic International Yearbook of Cognition, Logic and Communication     Open Access  
Basin Research     Hybrid Journal   (Followers: 5)
BIBECHANA     Open Access   (Followers: 2)
BIT Numerical Mathematics     Hybrid Journal  
BoEM - Boletim online de Educação Matemática     Open Access  
Boletim Cearense de Educação e História da Matemática     Open Access  
Boletim de Educação Matemática     Open Access  
Boletín de la Sociedad Matemática Mexicana     Hybrid Journal  
Bollettino dell'Unione Matematica Italiana     Full-text available via subscription   (Followers: 1)
British Journal of Mathematical and Statistical Psychology     Full-text available via subscription   (Followers: 21)
Bruno Pini Mathematical Analysis Seminar     Open Access  
Buletinul Academiei de Stiinte a Republicii Moldova. Matematica     Open Access   (Followers: 11)
Bulletin des Sciences Mathamatiques     Full-text available via subscription   (Followers: 4)
Bulletin of Dnipropetrovsk University. Series : Communications in Mathematical Modeling and Differential Equations Theory     Open Access   (Followers: 1)
Bulletin of Mathematical Sciences     Open Access   (Followers: 1)
Bulletin of the Brazilian Mathematical Society, New Series     Hybrid Journal  
Bulletin of the London Mathematical Society     Hybrid Journal   (Followers: 3)
Bulletin of the Malaysian Mathematical Sciences Society     Hybrid Journal  
Calculus of Variations and Partial Differential Equations     Hybrid Journal  
Canadian Journal of Science, Mathematics and Technology Education     Hybrid Journal   (Followers: 20)
Carpathian Mathematical Publications     Open Access   (Followers: 1)
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 1)
CHANCE     Hybrid Journal   (Followers: 6)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
ChemSusChem     Hybrid Journal   (Followers: 7)
Chinese Annals of Mathematics, Series B     Hybrid Journal  
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Mathematics     Open Access  
Clean Air Journal     Full-text available via subscription   (Followers: 2)
Cogent Mathematics     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 4)
Collectanea Mathematica     Hybrid Journal  
College Mathematics Journal     Full-text available via subscription   (Followers: 3)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Commentarii Mathematici Helvetici     Hybrid Journal   (Followers: 1)
Communications in Combinatorics and Optimization     Open Access  
Communications in Contemporary Mathematics     Hybrid Journal  
Communications in Mathematical Physics     Hybrid Journal   (Followers: 1)
Communications On Pure & Applied Mathematics     Hybrid Journal   (Followers: 3)
Complex Analysis and its Synergies     Open Access   (Followers: 2)
Complex Variables and Elliptic Equations: An International Journal     Hybrid Journal  
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 9)
Comptes Rendus Mathematique     Full-text available via subscription   (Followers: 1)
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 4)
Computational Methods and Function Theory     Hybrid Journal  
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 6)
Concrete Operators     Open Access   (Followers: 4)
Confluentes Mathematici     Hybrid Journal  
Contributions to Game Theory and Management     Open Access  
COSMOS     Hybrid Journal  
Cryptography and Communications     Hybrid Journal   (Followers: 14)
Cuadernos de Investigación y Formación en Educación Matemática     Open Access  
Cubo. A Mathematical Journal     Open Access  
Current Research in Biostatistics     Open Access   (Followers: 9)
Czechoslovak Mathematical Journal     Hybrid Journal   (Followers: 1)
Demographic Research     Open Access   (Followers: 11)
Demonstratio Mathematica     Open Access  
Dependence Modeling     Open Access  
Design Journal : An International Journal for All Aspects of Design     Hybrid Journal   (Followers: 28)
Developments in Clay Science     Full-text available via subscription   (Followers: 1)
Developments in Mineral Processing     Full-text available via subscription   (Followers: 3)
Dhaka University Journal of Science     Open Access  
Differential Equations and Dynamical Systems     Hybrid Journal   (Followers: 3)
Differentsial'nye Uravneniya     Open Access  
Discrete Mathematics     Hybrid Journal   (Followers: 8)
Discrete Mathematics & Theoretical Computer Science     Open Access  
Discrete Mathematics, Algorithms and Applications     Hybrid Journal   (Followers: 2)
Discussiones Mathematicae Graph Theory     Open Access   (Followers: 1)
Diskretnaya Matematika     Full-text available via subscription  
Dnipropetrovsk University Mathematics Bulletin     Open Access  
Doklady Akademii Nauk     Open Access  
Doklady Mathematics     Hybrid Journal  
Duke Mathematical Journal     Full-text available via subscription   (Followers: 1)
Eco Matemático     Open Access  
Edited Series on Advances in Nonlinear Science and Complexity     Full-text available via subscription  
Electronic Journal of Differential Equations     Open Access  
Electronic Journal of Graph Theory and Applications     Open Access   (Followers: 2)
Electronic Notes in Discrete Mathematics     Full-text available via subscription   (Followers: 2)
Elemente der Mathematik     Full-text available via subscription   (Followers: 4)
Energy for Sustainable Development     Hybrid Journal   (Followers: 9)
Enseñanza de las Ciencias : Revista de Investigación y Experiencias Didácticas     Open Access  
Ensino da Matemática em Debate     Open Access  
Entropy     Open Access   (Followers: 5)
ESAIM: Control Optimisation and Calculus of Variations     Full-text available via subscription   (Followers: 1)
European Journal of Combinatorics     Full-text available via subscription   (Followers: 5)
European Journal of Mathematics     Hybrid Journal   (Followers: 1)

        1 2 3 4 | Last

Journal Cover Cryptography and Communications
  [SJR: 0.55]   [H-I: 8]   [14 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1936-2455 - ISSN (Online) 1936-2447
   Published by Springer-Verlag Homepage  [2355 journals]
  • Universal secure rank-metric coding schemes with optimal communication
           overheads
    • Authors: Umberto Martínez-Peñas
      Abstract: Abstract We study the problem of reducing the communication overhead from a noisy wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available. We present its applications to reducing communication overheads in universal secure linear network coding and secure distributed storage with crisscross errors and erasures and in the presence of a wire-tapper. Our main contribution is a method to transform coding schemes based on linear rank-metric codes, with certain properties, to schemes with lower communication overheads. By applying this method to pairs of Gabidulin codes, we obtain coding schemes with optimal information rate with respect to their security and rank error correction capability, and with universally optimal communication overheads, when n ≤ m, being n and m the number of columns and number of rows, respectively. Moreover, our method can be applied to other families of maximum rank distance codes when n > m. The downside of the method is generally expanding the packet length, but some practical instances come at no cost.
      PubDate: 2018-01-13
      DOI: 10.1007/s12095-018-0279-4
       
  • Several new classes of linear codes with few weights
    • Authors: Hongwei Liu; Youcef Maouche
      Abstract: Abstract Let \(\phantom {\dot {i}\!}\mathbb {F}_{q}\) be a finite field of order q, where q = p s is a power of a prime number p. Let m and m1 be two positive integers such that m1 divides m. For any positive divisor e of q − 1, we construct an infinite family of codes with dimension m + m1 and few weights over \(\phantom {\dot {i}\!}\mathbb {F}_{q}\) . Using Gauss sum, their weight distributions are provided. When gcd(e, m) = 1, we obtain a subclass of optimal codes which attain the Griesmer bound. Moreover, when gcd(e, m) = 2 or 3 we construct new infinite families of codes with at most four weights.
      PubDate: 2018-01-11
      DOI: 10.1007/s12095-017-0277-y
       
  • On rate-1 and beyond-the-birthday bound secure online ciphers using
           tweakable block ciphers
    • Authors: Ashwin Jha; Mridul Nandi
      Abstract: Abstract Recently, Andreeva et al. showed that online ciphers are actually equivalent to arbitrary tweak length (ATL) tweakable block ciphers (TBCs). Within this result they gave a security preserving generic conversion from ATL TBCs to online ciphers. XTX by Minematsu and Iwata is a nice way of extending the tweak space of any fixed tweak length (FTL) TBC using a pAXU hash function. By combining the previous two methods one can get a FTL TBC based online cipher with security in the order of σ2ε where σ is the total number of blocks in all queries, and ε is the pAXU bound of the underlying hash function. In this paper we show that there are genuine practical issues which render it almost impossible to get full security using this approach. We then observe that a recent online enciphering scheme called POEx by Forler et al. is actually an implicit example of this approach. We show a flaw in the analysis of POEx which results in a birthday bound attack and invalidates the beyond-the-birthday bound OSPRP security claim. We take a slightly different approach then the one just mentioned and propose XTC which achieves OSPRP security of O(max(nσ2−n, σ22−(n + t))) where t is the tweak size and n is the block size. While doing so we present an impossibility result for t > n which can be of independent interest.
      PubDate: 2018-01-06
      DOI: 10.1007/s12095-017-0275-0
       
  • Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
    • Authors: Şaban Alaca; Goldwyn Millar
      Pages: 665 - 682
      Abstract: Abstract Binary sequences with good autocorrelation properties and large linear complexity are useful in stream cipher cryptography. The Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences have nearly optimal autocorrelation. However, the problem of determining the linear complexity of the SLCE sequences is still open. It is well known that one can gain insight into the linear complexity of a sequence if one can say something about the divisors of the gcd of a certain pair of polynomials associated with the sequence. Helleseth and Yang (IEEE Trans. Inf. Theory 49(6), 1548–1552 2002), Kyureghyan and Pott (Des. Codes Crypt. 29, 149–164 2003) and Meidl and Winterhof (Des. Codes Crypt. 8, 159–178 2006) were able to obtain some results of this type for the SLCE sequences. Kyureghyan and Pott (Des. Codes Crypt. 29, 149–164 2003) mention that it would be nice to obtain more such results. We derive new divisibility results for the SLCE sequences in this paper. Our approach is to exploit the fact that character values associated with the SLCE sequences can be expressed in terms of a certain type of Jacobi sum. By making use of known evaluations of Gauss and Jacobi sums in the “pure” and “small index” cases, we are able to obtain new insight into the linear complexity of the SLCE sequences.
      PubDate: 2017-11-01
      DOI: 10.1007/s12095-016-0208-3
      Issue No: Vol. 9, No. 6 (2017)
       
  • Design sequences with high linear complexity over finite fields using
           generalized cyclotomy
    • Authors: Vladimir Edemskiy; Xiaoni Du
      Pages: 683 - 691
      Abstract: Abstract Based on the generalized cyclotomy theory, we design some classes of sequences with high linear complexity over the finite fields. First, we construct a new class of sequence from some generalized cyclotomic sequences of different orders with different prime powers period. Then we obtain the discrete Fourier transform, defining pairs and the linear complexity of the new sequences. Finally, we study the linear complexity of a special class of q−ary (q prime) sequences.
      PubDate: 2017-11-01
      DOI: 10.1007/s12095-016-0209-2
      Issue No: Vol. 9, No. 6 (2017)
       
  • Several classes of permutation trinomials from Niho exponents
    • Authors: Nian Li; Tor Helleseth
      Pages: 693 - 705
      Abstract: Abstract Motivated by recent results on the constructions of permutation polynomials with few terms over the finite field \({\mathbb F}_{2^n}\) , where n is a positive even integer, we focus on the construction of permutation trinomials over \({\mathbb F}_{2^n}\) from Niho exponents. As a consequence, several new classes of permutation trinomials over \({\mathbb F}_{2^n}\) are constructed from Niho exponents based on some subtle manipulation of solving equations with low degrees over finite fields.
      PubDate: 2017-11-01
      DOI: 10.1007/s12095-016-0210-9
      Issue No: Vol. 9, No. 6 (2017)
       
  • Sequences of bent functions and near-bent functions
    • Authors: J. Wolfmann
      Pages: 729 - 736
      Abstract: Abstract We introduce infinite sequences of Boolean functions whose terms all are bent functions or all are near-bent functions.
      PubDate: 2017-11-01
      DOI: 10.1007/s12095-017-0212-2
      Issue No: Vol. 9, No. 6 (2017)
       
  • On the irreducibility of the hyperplane sections of Fermat varieties in
           ℙ 3 $\mathbb {P}^{3}$ in characteristic 2. II
    • Authors: Eric Férard
      Pages: 749 - 767
      Abstract: Abstract Let t be an integer ≥ 3 such that t ≡ 1 mod 4. The absolute irreducibility of the polynomial \(\phi _{t}(x, y) = \frac {x^{t} + y^{t} + 1 + (x + y + 1)^{t}}{(x + y)(x + 1)(y + 1)}\) (over \(\mathbb {F}_{2}\) ) plays an important role in the study of APN functions. We prove that this polynomial is absolutely irreducible under the assumptions that the largest odd integer which divides t − 1 is large enough and can not be written in a specific form.
      PubDate: 2017-11-01
      DOI: 10.1007/s12095-017-0213-1
      Issue No: Vol. 9, No. 6 (2017)
       
  • The cycle structure of LFSR with arbitrary characteristic polynomial over
           finite fields
    • Authors: Zuling Chang; Martianus Frederic Ezerman; San Ling; Huaxiong Wang
      Abstract: Abstract We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a method to find a state and a new way to represent the state are proposed.
      PubDate: 2017-12-20
      DOI: 10.1007/s12095-017-0273-2
       
  • Statistical properties of side-channel and fault injection attacks using
           coding theory
    • Authors: Claude Carlet; Sylvain Guilley
      Abstract: Abstract Naïve implementation of block ciphers are subject to side-channel and fault injection attacks. To deceive side-channel attacks and to detect fault injection attacks, the designer inserts specially crafted error correcting codes in the implementation. The impact of codes on protection against fault injection attacks is well studied: the number of detected faults relates to their minimum distance. However, regarding side-channel attacks, the link between codes and protection efficiency is blurred. In this paper, we relate statistical properties of code-based countermeasures against side-channel attacks to their efficiency in terms of security, against uni- and multi-variate attacks.
      PubDate: 2017-12-14
      DOI: 10.1007/s12095-017-0271-4
       
  • Some quantum MDS codes with large minimum distance from generalized
           Reed-Solomon codes
    • Authors: Xueying Shi; Qin Yue; Yaotsu Chang
      Abstract: Abstract Quantum maximum-distance-separable (MDS) codes are a significant class of quantum codes. In this paper, we mainly utilize classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct five new classes of quantum MDS codes with large minimum distance.
      PubDate: 2017-12-14
      DOI: 10.1007/s12095-017-0274-1
       
  • Multiple (Truncated) Differential Cryptanalysis: Explicit Upper Bounds on
           Data Complexity
    • Authors: Subhabrata Samajder; Palash Sarkar
      Abstract: Abstract Statistical analyzes of multiple (truncated) differential attacks are considered in this paper. Following the work of Blondeau and Gérard, the most general situation of multiple differential attack where there are no restrictions on the set of differentials is studied. We obtain closed form upper bounds on the data complexity in terms of the success probability and the advantage of an attack. This is done under two scenarios – one, where an independence assumption used by Blondeau and Gérard is assumed to hold and second, where no such assumption is made. The first case employs the Chernoff bounds while the second case uses the Hoeffding bounds from the theory of concentration inequalities. In both cases, we do not make use of any approximations in our analysis. Moreover, the results are more generally applicable compared to previous works. The analysis without the independence assumption is the first of its kind in the literature. We believe that the current work places the statistical analysis of multiple (truncated) differential attack on a more rigorous foundation than what was previously known.
      PubDate: 2017-12-04
      DOI: 10.1007/s12095-017-0268-z
       
  • Cyclic codes over M 2 ( 𝔽 2 + u 𝔽 2 ) $M_{2}(\mathbb
           {F}_{2}+u\mathbb {F}_{2})$
    • Authors: Rong Luo; Udaya Parampalli
      Abstract: Abstract Let \(A=M_{2}(\mathbb {F}_{2}+u\mathbb {F}_{2})\) , where u 2 = 0, the ring of 2 × 2 matrices over the finite ring \(\mathbb {F}_{2}+u\mathbb {F}_{2}\) . The ring A is a non-commutative Frobenius ring but not a chain ring. In this paper, we derive the structure theorem of cyclic codes of odd length over the ring A and use them to construct some optimal cyclic codes over \(\mathbb {F}_{4}\) . Let v 2 = 0 and u v = v u. We also give an isometric map from A to \(\mathbb {F}_{4}+v\mathbb {F}_{4}+u\mathbb {F}_{4}+uv\mathbb {F}_{4}\) using their respective Bachoc weight and Lee weight.
      PubDate: 2017-12-01
      DOI: 10.1007/s12095-017-0266-1
       
  • Five classes of optimal two-weight linear codes
    • Authors: Gaojun Luo; Xiwang Cao
      Abstract: Abstract Linear codes with few weights have applications in secret sharing, authentication codes, association schemes, data storage systems, strongly regular graphs and some other fields. Two-weight linear codes are particularly interesting since they are closely related to finite geometry, combinatorial designs, graph theory. In this paper, we propose five classes of two-Lee-weight codes over the ring \(\mathbb {F}_{q}+u\mathbb {F}_{q}\) . By the Gray map, we obtain five classes of linear codes with two weights over \(\mathbb {F}_{q}\) and these linear codes are optimal with respect to the Griesmer bound. As applications, we can employ these linear codes to construct secret sharing schemes with nice access structures.
      PubDate: 2017-12-01
      DOI: 10.1007/s12095-017-0272-3
       
  • Editorial: Special issue on recent trends in cryptography
    • Authors: Tor Helleseth; Bart Preneel
      PubDate: 2017-11-25
      DOI: 10.1007/s12095-017-0269-y
       
  • Complete weight enumerators of three classes of linear codes
    • Authors: Gaojun Luo; Xiwang Cao
      Abstract: Abstract In recent years, a great deal of effort has been devoted to the study of linear codes with few weights, since they have applications in secret sharing, authentication codes, association schemes and some other fields. In this paper, we propose three classes of linear codes by using proper defining sets and investigate their complete weight enumerators. As applications, these linear codes are employed to construct secret sharing schemes with access structures and systematic authentication codes. Moreover, we obtain three classes of asymptotically optimal systematic authentication codes.
      PubDate: 2017-11-25
      DOI: 10.1007/s12095-017-0270-5
       
  • Nonlinear vectorial primitive recursive sequences
    • Authors: Sartaj Ul Hasan; Daniel Panario; Qiang Wang
      Abstract: Abstract We discuss nonlinear vectorial primitive recursive sequences. First we consider the nonlinearly filtered multiple-recursive matrix generator for producing pseudorandom vectors based on some nonlinear schemes and give lower bounds for their componentwise linear complexity. Moreover, we obtain certain results concerning the jump multiple-recursive matrix generator and establish that sequences generated by them have better period and componentwise linear complexity as compared to usual multiple-recursive matrix generator sequences. We also include analogous results for transformation shift registers for generating pseudorandom vectors.
      PubDate: 2017-11-15
      DOI: 10.1007/s12095-017-0265-2
       
  • Correlation immune functions with respect to the q -transform
    • Authors: Ting Gu; Zhixiong Chen; Andrew Klapper
      Abstract: Abstract Correlation immunity is a measure of resistance to Siegenthaler’s divide and conquer attack on nonlinear combiners. In this work, we study functions with regard to the q-transform, a generalization of the Walsh-Hadamard transform, that measures the proximity of a function to the set of functions obtained from a function q(x) by linear base change. We propose two notions of q-correlation immune functions and study their relationship between them. We also analyze certain properties of these functions and present some techniques to design these functions.
      PubDate: 2017-11-09
      DOI: 10.1007/s12095-017-0267-0
       
  • Design and analysis of small-state grain-like stream ciphers
    • Authors: Matthias Hamann; Matthias Krause; Willi Meier; Bin Zhang
      Abstract: Abstract Time-memory-data (TMD) tradeoff attacks limit the security level of many classical stream ciphers to the birthday bound. Very recently, a new field of research has emerged, which searches for so-called small-state stream ciphers that try to overcome this limitation. In this paper, existing designs and known analysis of small-state stream ciphers are revisited and new insights on distinguishers and key recovery are derived based on TMD tradeoff attacks. A particular result is the transfer of a generic distinguishing attack suggested in 2007 by Englund et al. to this new class of lightweight ciphers. Our analysis shows that the initial hope of achieving full security against TMD tradeoff attacks by continuously using the secret key has failed. In particular, we provide generic distinguishers for Plantlet and Fruit with complexity significantly smaller than that of exhaustive key search. However, by studying the assumptions underlying the applicability of these attacks, we are able to come up with a new design idea for small-state stream ciphers, which might allow to finally achieve full security against TMD tradeoff attacks. Another contribution of this paper is the first key recovery attack against the most recent version of Fruit. We show that there are at least 264 weak keys, each of which does not provide 80-bit security as promised by designers.
      PubDate: 2017-11-08
      DOI: 10.1007/s12095-017-0261-6
       
  • Malleability of the blockchain’s entropy
    • Authors: Cécile Pierrot; Benjamin Wesolowski
      Abstract: Abstract Trustworthy generation of public random numbers is necessary for the security of a number of cryptographic applications. It was suggested to use the inherent unpredictability of blockchains as a source of public randomness. Entropy from the Bitcoin blockchain in particular has been used in lotteries and has been suggested for a number of other applications ranging from smart contracts to election auditing. In this Arcticle, we analyse this idea and show how an adversary could manipulate these random numbers, even with limited computational power and financial budget.
      PubDate: 2017-11-03
      DOI: 10.1007/s12095-017-0264-3
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 54.226.179.247
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016