Modular Inverse as a Problem – crypto.stackexchange.com

Modular Inverse as a Problem – crypto.stackexchange.com

09:44 No Comments
Given a modulus $N$ and a number $a$, a multiplicative inverse exists for $a$ if $a$ and $N$ are coprime. Why isn’t their a cryptosystem that uses this as a problem? Example: Alice and Bob agree on a ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

0 Comment to "Modular Inverse as a Problem – crypto.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)