An Efficient Identification Scheme Based on Permuted Patterns

Shahrokh Saeednia

Paper 2000/021

An Efficient Identification Scheme Based on Permuted Patterns

Shahrokh Saeednia

Abstract

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.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: Identification NP-completeness Smart cards.
Contact author(s): saeednia @ ulb ac be
History: 2001-01-16: revised; 2000-05-25: received; See all versions
Short URL: https://ia.cr/2000/021
License: CC BY

BibTeX

@misc{cryptoeprint:2000/021,
      author = {Shahrokh Saeednia},
      title = {An Efficient Identification Scheme Based on Permuted Patterns},
      howpublished = {Cryptology {ePrint} Archive, Paper 2000/021},
      year = {2000},
      url = {https://eprint.iacr.org/2000/021}
}