Zero knowledge cryptographic system for electronic payment uses factorization and discrete logarithm

摘要

The system uses public key verification (B) of a proof generated (A) by modulo (n) exponentiation from a secret key of a random number (r) to create a common number (c) by linear combination with the private key (s) used for a second proof (Y) that the first proof is product modulo (n) of the second with a third integer (e) and fourth integer (v) in the public key with exponent (c)