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

ECDSA verification: Refactor a*g + b*p multiplication #1757

Merged
merged 4 commits into from
Oct 18, 2023
Merged

Commits on Oct 17, 2023

  1. NFC P-256: Add twin_mul method to PublicScalarOps.

    Allow each curve to provide its own `twin_mul` implementation. For now,
    use the same implementation we've been using.
    briansmith committed Oct 17, 2023
    Configuration menu
    Copy the full SHA
    40018e3 View commit details
    Browse the repository at this point in the history
  2. Import ecp_nistz256_points_mul_public from BoringSSL.

    From BoringSSL commit 8d71d24.
    
    Comment it out until it is modified to work.
    briansmith committed Oct 17, 2023
    Configuration menu
    Copy the full SHA
    83ceb38 View commit details
    Browse the repository at this point in the history

Commits on Oct 18, 2023

  1. P-256 ECDSA verification: Use optimized nistz256 verification.

    Import the optimized nistz256 verification from BoringSSL.
    briansmith committed Oct 18, 2023
    Configuration menu
    Copy the full SHA
    bc7051d View commit details
    Browse the repository at this point in the history
  2. P-256 ECDSA verification: Clarify multiplication.

    Move more of the logic for the nistz256 multiplication into Rust.
    briansmith committed Oct 18, 2023
    Configuration menu
    Copy the full SHA
    107c046 View commit details
    Browse the repository at this point in the history