Welcome to the resource topic for 2000/021
An Efficient Identification Scheme Based on Permuted Patterns
Authors: Shahrokh SaeedniaAbstract:
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.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .