Lably
Skip to content

Feige–Fiat–Shamir identification scheme

  • 2 min read
  • 3 chapters

Related on Lably

Through Modular arithmetic and Coprime integers

Setup

Following a common convention, call the prover Peggy and the verifier Victor.

Choose two large prime integers p and q and compute the product n = pq. Create secret numbers s1,⋯,sk coprime to n. Compute vi≡si2(modn). Peggy and Victor both receive n while p and q are kept secret. Peggy is then sent the numbers si. These are her secret login numbers. Victor is sent the numbers vi by Peggy when she wishes to identify herself to Victor. Victor is unable to recover Peggy's si numbers from his vi numbers due to the difficulty in determining a modular square root when the modulus' factorization is unknown.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Computing and communication