par Saeednia, Shahrokh
Référence IEEE transactions on information theory, 48, 7, page (2092-2094)
Publication Publié, 2002-07
Article révisé par les pairs
Résumé : Three partition problems was proposed and the fact that these problems were NP-complete was shown. The first problem constitutes the security basis of the identification scheme. The second was introduced in order to prove that the scheme functions correctly. The third problem was a combination of the first and second problem. The proof of the NP-completeness was given and some particular cases of the problems were discussed.