A (non-practical) three-pass identification protocol using coding theory
- Cite this paper as:
- Girault M. (1990) A (non-practical) three-pass identification protocol using coding theory. In: Seberry J., Pieprzyk J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg
At EUROCRYPT'89, Stern has presented an identification scheme whose security is based on general linear decoding problem, which is NP-hard. The number of passes of the protocol he designed is five. In this paper, we propose an alternative protocol which works with only three passes and is much simpler to describe (that is the good news) but which is not practical (the bad news).
Unable to display preview. Download preview PDF.