Abstract
We present in this paper an idea of how to reduce the number of possible permutations when trying to solve the permuted kernels problem. We refer to the identification scheme of Shamir [2] and we also show how a dishonest prover can maximize his prospects to pass the test.
Article PDF
Similar content being viewed by others
References
D. H. Lehmer, Computer technology applied to the theory of numbers. In W. J. LeVeque, Studies in Number Theory, pp. 117–151, Prentice-Hall, Englewood Cliffs, NJ, 1969.
A. Shamir, An efficient identification scheme based on permuted kernels. In G. Brassard, editor, Advances in Cryptology—Cryoto '89 Proceedings, Santa Barbara, California, August 20–24. (Lecture Notes in Computer Sciences, Vol. 435), pp. 606–609, Springer-Verlag, Berlin, 1990.
Author information
Authors and Affiliations
Additional information
Communicated by Rainer A. Rueppel
Rights and permissions
About this article
Cite this article
Georgiades, J. Some remarks on the security of the identification scheme based on permuted kernels. J. Cryptology 5, 133–137 (1992). https://doi.org/10.1007/BF00193565
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00193565