Signature blinding

Open
#133 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
python
Domain
cryptography

Research direction

The issue does not name files, tests, or an entry point. Start by locating the ECDSA signing implementation and its existing scalar-arithmetic tests, then determine how blinding should fit the public API and test vectors. Done means a reviewed blinding design, implementation, and coverage demonstrating the stated equation.

Written by the indexing model from the issue text.

Description

feature

While blinding in ECC is not really practical for performance applications, it would be a good teaching opportunity to show how blinding can be performed in ECDSA signatures.

the new equation for s would be as follows:

s = inv_blind * inv_k * (blind * m + blind * r * priv_key) % order

where inv_blind and inv_k are multiplicative inverses modulo order of blind and k respectively

Dominant language
Python
Stars
973
Forks
343
PR merge metrics
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from tlsfuzzer/python-ecdsa

All issues in tlsfuzzer/python-ecdsa

Similar issues

More Python issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.