![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Exploring SAT for Cryptanalysis: (Quantum) Collision Attacks Against 6-Round SHA-3
In this work, we focus on collision attacks against instances of SHA-3 hash family in both classical and quantum settings. Since the 5-round collision attacks on SHA3-256 and other variants proposed by Guo et al.
-
Article
Practical Collision Attacks against Round-Reduced SHA-3
The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 standard of NIST in 2015. In this paper, we focus on practical collision attacks against round-reduced SHA-3 and so...
-
Article
New developments in q-polynomial codes
Cyclic codes are prominently used in electronics and communication engineering. A new view on cyclic codes based on q-polynomials has been introduced by Ding and Ling. This paper is concerned with new development...
-
Chapter and Conference Paper
Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
This paper proposes a new generalized ElGamal public key encryption scheme based on a new Diffie-Hellman problem, so-called EDDH problem, which DDH problem can be reduced to. This scheme is one-way if and only...
-
Chapter and Conference Paper
Some Notes on d-Form Functions with Difference-Balanced Property
The relation between a cyclic relative difference set and a cyclic difference set is considered. Both the sets are with Singer parameters and can be constructed from a difference-balanced d-form function. Althoug...
-
Chapter and Conference Paper
Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm
An upper bound is established for certain exponential sums with respect to multiplicative characters defined on the rational points of an elliptic curve over a prime field. The bound is applied to investigate ...
-
Chapter and Conference Paper
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences
An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q ...