On the Security of the Permuted Kernel Identification Scheme

Authors:
Thierry Baritaud;Mireille Campana;Pascal Chauvaud;Henri Gilbert
Affiliations:
-;-;-;-
Venue:
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Year:
1992

Citing 2
Cited 4

Some remarks on the security of the identification scheme based on permuted kernels

Journal of Cryptology
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology

A New \mathcal{NP}-Complete Problem and Public-Key Identification

Designs, Codes and Cryptography
Improved Algorithms for the Permuted Kernel Problem

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Designing Identification Schemes with Keys of Short Size

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of PKP: A New Approach

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A zero-knowledge identification scheme built upon the so-called Permuted Kernel Problem (PKP) was proposed by Adi Shamir in 1989 [1].In this paper, we present a time-memory trade-off leading to a reduction of the computation time for solving the PKP problem, as compared with the best known attack mentioned in [1].