## CryptoDB

### Paper: An Efficient Identification Scheme Based on Permuted Patterns

Authors: Shahrokh Saeednia URL: http://eprint.iacr.org/2000/021 Search ePrint Search Google This paper proposes a new identification scheme based on a hard partition problem rather than factoring or discrete logarithm problems. The new scheme minimizes at the same time the communication complexity and the computational cost required by the parties. Since only simple operations are needed for an identification, our scheme is well suited for smart cards with very limited processing power. With a "good" implementation, the scheme is much faster than the Fiat-Shamir or Shamir's PKP schemes.
##### BibTeX
@misc{eprint-2000-11365,
title={An Efficient Identification Scheme Based on Permuted Patterns},
booktitle={IACR Eprint archive},
keywords={Identification, NP-completeness, Smart cards.},
url={http://eprint.iacr.org/2000/021},
note={ saeednia@ulb.ac.be 11338 received 24 May 2000, revised 16 Jan 2001},
author={Shahrokh Saeednia},
year=2000
}