16 search results - page 1 / 4 » Cryptanalysis of PKP: A New Approach |
PKC
2001
Springer
13 years 9 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
DCC
2011
IEEE
12 years 12 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...