![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Automatic Search of Linear Structure: Applications to Keccak and Ascon
The linear structure technique was developed by Guo et al. at ASIACRYPT 2016, notably boosting the preimage attacks on Keccak. This technique transforming the preimage attack into solving algebraic systems allows...
-
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.
-
Chapter and Conference Paper
Rebound Attacks on \(\textsf{SKINNY}\) Hashing with Automatic Tools
In ToSC’20, a new approach combining Mix-Integer Linear Programming (MILP) tool and Constraint Programming (CP) tool to search for boomerang distinguishers is proposed and later used for rebound attack in ASIA...
-
Chapter and Conference Paper
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
We investigate an upper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate...
-
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 ...
-
Chapter and Conference Paper
Fast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p n over GF(q) , where p is an odd prime, q is a prime and a primit...