Skip to main content
Conference ProceedingsOPEN ACCESS

On the security of the permuted kernel identification scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 740 LNCS 305-311
DOI: 10.1007/3-540-48071-4_21
15Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Zero-knowledge identification scheme built upon the so-called Permitted 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 rime for solving the PKP problem, as compared with the best known attack mentioned in [1].

Cite

CITATION STYLE

APA

Baritaud, T., Campana, M., Chauvaud, P., & Gilbert, H. (1993). On the security of the permuted kernel identification scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 740 LNCS, pp. 305–311). Springer Verlag. https://doi.org/10.1007/3-540-48071-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free