Sciweavers

PKC
2001
Springer

Cryptanalysis of PKP: A New Approach

14 years 4 months ago
Cryptanalysis of PKP: A New Approach
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, the authors claimed that their approach could be applied to other problems. In this paper, we describe such an application and show a new way to attack the Permuted Kernel Problem. This new method is faster than any previously known technique but still requires exponential time. In practice, we find that attacking PKP for the original size proposed by Shamir in [6] could be done on a single PC in 125 years.
Éliane Jaulmes, Antoine Joux
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where PKC
Authors Éliane Jaulmes, Antoine Joux
Comments (0)