Advertisement

On the Security of the Permuted Kernel Identification Scheme

  • Thierry Baritaud
  • Mireille Campana
  • Pascal Chauvaud
  • Henri Gilbert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 740)

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].

Keywords

Identification Scheme Time Cost Smart Card Require Storage Elementary Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Adi Shamir, “An Efficient Identification Scheme Based on Permuted Kernels”, Proceedings of Crypto’89, Springer Verlag.Google Scholar
  2. [2]
    J. Georgiades, “Some Remarks on the Security of the Identification Scheme Based on the Permuted Kernel”, Journal of Cryptology, Volume 5, Number 2, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Thierry Baritaud
    • 1
  • Mireille Campana
    • 1
  • Pascal Chauvaud
    • 1
  • Henri Gilbert
    • 1
  1. 1.Centre National d’Etudes des TélécommuicationsPAA/TSA/SRCIssy Ies MoulineauxFrance

Personalised recommendations