Skip to main content
Ctrl+K

blockchainkit

  • Start here: a blockchain without the jargon
  • Your first payment, step by step
  • Glossary
  • Subpackages
  • History
    • Examples
    • Tutorials
    • Exercises
    • Exact conventions and model boundaries
    • Reproducible experiments and research scope
    • API
    • Developing blockchainkit
  • GitHub
  • Start here: a blockchain without the jargon
  • Your first payment, step by step
  • Glossary
  • Subpackages
  • History
  • Examples
  • Tutorials
  • Exercises
  • Exact conventions and model boundaries
  • Reproducible experiments and research scope
  • API
  • Developing blockchainkit
  • GitHub

Section Navigation

  • blockchainkit.crypto
    • Blind signatures
    • Commitments
    • Elliptic curves
    • Discrete logarithms
    • Hash-based signatures
    • Hashing
    • One-time pad
    • Public-key exchange
    • Secret sharing
    • Proofs and signatures
  • blockchainkit.structures
    • Bloom filters
    • Chains and payments
    • Hash chains
    • Ledgers
    • Merkle trees
    • Light clients
    • State commitments
    • Timestamping
    • Transaction identity
    • Unspent outputs
  • blockchainkit.consensus
    • Agreement protocols
    • Attacks and their probabilities
    • Nakamoto consensus
    • Proof of stake
    • Proof of work
  • blockchainkit.network
    • Simulated and logical time
    • Gossip and broadcast
    • Peer graphs
    • Overlays and their attacks
    • Block and transaction relay
    • Replication under partitions
  • blockchainkit.vm
    • Contracts and verification
    • Ethereum
    • Foundations of stack machines
    • Replicated and atomic execution
    • Bitcoin Script
  • Examples
  • Examples
  • Discrete logarithms

Discrete logarithms#

Generic attacks on the problem behind Diffie-Hellman and Schnorr.

Baby-step giant-step: square-root discrete logs (Shanks 1971)

Baby-step giant-step: square-root discrete logs (Shanks 1971)

Pohlig-Hellman: why the group order must have a large prime factor (1978)

Pohlig-Hellman: why the group order must have a large prime factor (1978)

previous

Elliptic-curve cryptography: a finite group you can draw (Miller and Koblitz 1985)

next

Baby-step giant-step: square-root discrete logs (Shanks 1971)
Show Source

© Copyright 2026, Charles Poli.

Created using Sphinx 9.1.0.

Built with the PyData Sphinx Theme 0.22.0.