You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Mar 25, 2024. It is now read-only.
we only need to select r < n for encryption. In the existing code, r is sampled from n^2 and then raised to n mod n^2. Thus, the goal is to pick r from n.
##Resources
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Acceptance criteria
Well documented code
Tests pass with more than 80% test coverage
Static analysis should pass
Code should be reviewed by two engineers
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Goal
we only need to select r < n for encryption. In the existing code, r is sampled from n^2 and then raised to n mod n^2. Thus, the goal is to pick r from n.
##Resources
Acceptance criteria
The text was updated successfully, but these errors were encountered: