Johannes Bauer personal blog
A Detailed Elliptic Curve Cryptography Tutorial
When adding two integers i and j of bitlength b, the result will be of bitlength b + 1 in the worst case. This means they can easily be naively added. If the result is larger or equal to F p one has only to subtract p from the result, i.e.:
- Points
- 184
- HN comments
- 15
- Submissions
- 1
- Cited by
- 0 commenters
Security & PrivacyMath & Algorithms2017
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Jul 9, 2017 | A Detailed Elliptic Curve Cryptography Tutorial by 68c12c16 | 184 | 15 |
