Resource estimates show Shor's algorithm can break 256-bit ECDLP with fewer than 1450 logical qubits and 90 million Toffoli gates on fast-clock quantum hardware, enabling on-spend attacks on cryptocurrency mempools.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
A public ledger is a tamperproof sequence of data that can be read and augmented by everyone. Public ledgers have innumerable and compelling uses. They can secure, in plain sight, all kinds of transactions ---such as titles, sales, and payments--- in the exact order in which they occur. Public ledgers not only curb corruption, but also enable very sophisticated applications ---such as cryptocurrencies and smart contracts. They stand to revolutionize the way a democratic society operates. As currently implemented, however, they scale poorly and cannot achieve their potential. Algorand is a truly democratic and efficient way to implement a public ledger. Unlike prior implementations based on proof of work, it requires a negligible amount of computation, and generates a transaction history that will not "fork" with overwhelmingly high probability. Algorand is based on (a novel and super fast) message-passing Byzantine agreement. For concreteness, we shall describe Algorand only as a money platform.
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Introduces fair validity for Byzantine agreement and a synchronous protocol achieving it with responsiveness and partition resilience under 1/3 corruptions.
StakeDag introduces a stake-weighted consensus protocol S_φ for leaderless asynchronous DAGs to achieve pBFT by treating stake as validating weights in a system separating users and validators.
citing papers explorer
-
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
Resource estimates show Shor's algorithm can break 256-bit ECDLP with fewer than 1450 logical qubits and 90 million Toffoli gates on fast-clock quantum hardware, enabling on-spend attacks on cryptocurrency mempools.
-
Fair Byzantine Agreements for Blockchains
Introduces fair validity for Byzantine agreement and a synchronous protocol achieving it with responsiveness and partition resilience under 1/3 corruptions.
-
StakeDag: Stake-based Consensus For Scalable Trustless Systems
StakeDag introduces a stake-weighted consensus protocol S_φ for leaderless asynchronous DAGs to achieve pBFT by treating stake as validating weights in a system separating users and validators.