Johannes Bauer

Blogs are so out of fashion that I decided to start one. All of the views shown herein are those of me alone. Here's the content so far:

Popular posts: 1
Total points: 184
HN comments: 15
Rank: #13,593 personal

Visit johannes-bauer.com → On Hacker News Jul 2017 – Jul 2017

Security & Privacy 1 Math & Algorithms 1

Most points Most discussed Most cited Newest

A Detailed Elliptic Curve Cryptography Tutorial

2017184 points15 comments Security & Privacy details

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.: