Title :
A fast identification scheme
Author_Institution :
Toulon Univ., La Garde, France
Abstract :
Many cryptographic protocols depend on one and only problem, the one of factoring. This paper presents a new identification scheme whose security depends on an NP-complete problem from the theory of error correcting codes: the syndrome decoding problem. The computation complexity of the proposed scheme is smaller than those of the other schemes based on SD problem. Moreover the amount of memory needed by the prover is very small
Keywords :
computational complexity; cryptography; decoding; error correction codes; identification; matrix decomposition; protocols; NP-complete problem; SD problem; computation complexity; cryptographic protocols; error correcting codes; factoring; fast identification scheme; prover; security; syndrome decoding problem; Binary codes; Certification; Cryptographic protocols; Decoding; Error correction codes; Hamming weight; NP-complete problem; Reactive power; Security; Vectors;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550346
