Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
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
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.