Photo by Andrés Gómez on Unsplash

Password Juggling in Discrete Logs and Elliptic Curves

I love implementing things in discrete logs and then converting them into elliptic curve methods. Basically a exponentiation (g^x mod p) becomes a multiplication (xG), a multiplication (g^x g^y mod p) becomes a point addition (xG+yG), and a division (g^x /g^y mod p) becomes a point subtraction (xG-yG). In this article I will show all three of these operations, and show how we can convert from…

Professor Cryptography. Serial innovator. Believer in fairness, justice & freedom. EU Citizen in heart. Living by the sea. Old World Breaker. New World Creator.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

USIM is here!

On the Importance of Arrange, Act, Assert

Inversion of Control(IoC) and Dependency Injection(DI)

Developing software to solve the problem of counting growing plants

Introduction to Fuzzy Logic

Alibaba Cloud Launches HiTSDB to Accelerate Migration of IoT Devices to the Cloud

Trending things to know in Java

Artificial Intelligence and many more things to know in 2022 by use of JAVA

For Beginners: Let’s Solve Algorithmic Coding Problems!

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Prof Bill Buchanan OBE

Prof Bill Buchanan OBE

Professor Cryptography. Serial innovator. Believer in fairness, justice & freedom. EU Citizen in heart. Living by the sea. Old World Breaker. New World Creator.

More from Medium

The Wonderful BLS12 Curves … Just Ready For a Privacy-Respecting World

The Answer to Life, The Universe, and Cybersecurity …

So What Is AEAD? And Why Is It So Important for Encryption?