Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

How to ensure that r and N are relatively prime #4

Open
realTaki opened this issue Jan 23, 2021 · 0 comments
Open

How to ensure that r and N are relatively prime #4

realTaki opened this issue Jan 23, 2021 · 0 comments

Comments

@realTaki
Copy link

line 106 func EncryptAndNonce(pubKey *PublicKey, plainText []byte) ([]byte, *big.Int, error)
line 107 r, err := rand.Int(rand.Reader, pubKey.N)
r just a random int,
How to ensure that r and N are relatively prime , gcd(r,N)=1?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant