Add Paillier-Blum modulus and small-factor proofs#15
Open
tob-joe wants to merge 5 commits intotrailofbits:mainfrom
Open
Add Paillier-Blum modulus and small-factor proofs#15tob-joe wants to merge 5 commits intotrailofbits:mainfrom
tob-joe wants to merge 5 commits intotrailofbits:mainfrom
Conversation
Changes: - Updated trait definition to use const MARK - Modified derive macro to generate constants instead of methods - Updated documentation to reflect the new API - Adapted test to use constant reference for custom marks Resolves trailofbits#6 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
Add deny(warnings) and deny(clippy::pedantic), fix all warnings. Resolves trailofbits#12 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
Implements Small-Factor Proof from Figure 26 (Canetti et al. 2024). Proves RSA modulus N₀ = pq has factors p, q > 2^ℓ using Pedersen commitments. 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
- Implement Paillier-Blum modulus proof (Figure 12) with safe prime generation - Add Jacobi symbol verification, compositeness check, and p ≠ q validation - Extract shared crypto helpers (is_probably_prime, extended_gcd, jacobi_symbol, generate_prime) to examples/crypto_helpers.rs - Add opt-level = 2 to dev profile for faster test execution - All 28 Paillier-Blum tests and 8 small-factor tests pass 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Implements Paillier-Blum modulus proof (Figure 12) and small-factor proof (Figure 26) from Canetti et al. (2024) "UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts" (CGGMP21).
Implementation
Testing
Resolves #14
🤖 Generated with Claude Code