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.

Sign up for GitHub

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

Minor edits on README.md #1645

Closed
wants to merge 2 commits into from
Closed

Minor edits on README.md #1645

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
195d15d
Minor edits on README.md
Gudnessuche Dec 11, 2024
5b69348
Update README.md
Gudnessuche Dec 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ Features:
* Additive and multiplicative tweaking of secret/public keys.
* Serialization/parsing of secret keys, public keys, signatures.
* Constant time, constant memory access signing and public key generation.
* Derandomized ECDSA (via RFC6979 or with a caller provided function.)
* Derandomized ECDSA (via RFC6979 or with a caller provided function).
* Very efficient implementation.
* Suitable for embedded systems.
* No runtime dependencies.
Expand Down Expand Up @@ -57,7 +57,7 @@ Implementation details
* Use a precomputed table of multiples of powers of 16 multiplied with the generator, so general multiplication becomes a series of additions.
* Intended to be completely free of timing sidechannels for secret-key operations (on reasonable hardware/toolchains)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What about this line? And I think there are further lines.

* Access the table with branch-free conditional moves so memory access is uniform.
* No data-dependent branches
* No data-dependent branches.
* Optional runtime blinding which attempts to frustrate differential power analysis.
* The precomputed tables add and eventually subtract points for which no known scalar (secret key) is known, preventing even an attacker with control over the secret key used to control the data internally.

Expand Down
Loading