# discrete logarithm

Published articles for discrete logarithm.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Sending and Authenticating Messages with Elliptic Curves

DevFeed: [Sending and Authenticating Messages with Elliptic Curves](<https://devfeed.tech/articles/sending-and-authenticating-messages-with-elliptic-curves-40355.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2014/04/14/sending-and-authenticating-messages-with-elliptic-curves/>)

Published: 2014-04-14T10:00:38Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Security](<https://devfeed.tech/topics/security.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Python](<https://devfeed.tech/topics/python.md>), [Code](<https://devfeed.tech/topics/code.md>), [Learning](<https://devfeed.tech/topics/learning.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [diffie-hellman](<https://devfeed.tech/tags/diffie-hellman.md>), [digital-signature](<https://devfeed.tech/tags/digital-signature.md>), [discrete-logarithm](<https://devfeed.tech/tags/discrete-logarithm.md>), [elliptic-curves](<https://devfeed.tech/tags/elliptic-curves.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [python](<https://devfeed.tech/tags/python.md>), [security](<https://devfeed.tech/tags/security.md>), [shamir-massey-omura](<https://devfeed.tech/tags/shamir-massey-omura.md>)

### AI overview

A tutorial explains how the Shamir-Massey-Omura protocol can send a message without a pre-shared secret, using elliptic-curve point operations and private locking values. It also notes that the accompanying Python implementations are intended for learning rather than practical security use.

### Source excerpt

Last time we saw the Diffie-Hellman key exchange protocol, and discussed the discrete logarithm problem and the related Diffie-Hellman problem, which form the foundation for the security of most protocols that use elliptic curves. Let's continue our journey to investigate some more protocols. Just as a reminder, the Python implementations of these protocols are not at all meant for practical use, but for learning purposes. We provide the code on this blog's Github page, but for the love of security don't actually use them.

## Elliptic Curve Diffie-Hellman

DevFeed: [Elliptic Curve Diffie-Hellman](<https://devfeed.tech/articles/elliptic-curve-diffie-hellman-40353.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2014/03/31/elliptic-curve-diffie-hellman/>)

Published: 2014-03-31T10:22:51Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Security, Privacy and Abuse Prevention](<https://devfeed.tech/topics/security-privacy-and-abuse-prevention.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [diffie-hellman](<https://devfeed.tech/tags/diffie-hellman.md>), [discrete-logarithm](<https://devfeed.tech/tags/discrete-logarithm.md>), [elliptic-curves](<https://devfeed.tech/tags/elliptic-curves.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [rsa](<https://devfeed.tech/tags/rsa.md>)

### AI overview

This tutorial introduces the use of elliptic curves in cryptography, covering their mathematical history, point addition, the discrete logarithm problem, and the origins of elliptic-curve cryptography. The supplied excerpt also mentions concerns about vulnerable elliptic-curve standards and backdoor access.

### Source excerpt

So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition.