trailofbits / trailofbits/decree
Add small-factor proof from CGGMP21
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 12
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
Implement the small-factor proof from Figure 26 of Canetti et al. (2024), "UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts" (CGGMP21).
The proof demonstrates that an RSA modulus N₀ = pq has factors above a threshold 2^ℓ without revealing p or q.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading Figure 26 of Canetti et al. (2024), "UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts," and determine how its small-factor proof should fit into the Decree Fiat Shamir Library. Done means implementing the proof that an RSA modulus N₀ = pq has factors above 2^ℓ without revealing p or q, with the relevant verification behavior covered.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- cryptography
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100