Algorand: Subset-Sum Hash Specification

September 3, 2021

Research

Written by: Algorand Foundation

This research paper by Algorand presents the specification of the Subset Sum Hash function, whose quantum-cryptanalysis has proven to have at least 128 bits of security against known quantum collision-finding attacks. This primitive is used by Algorand consensus to generate State Proofs.

To read in full, click here.

Related posts

Press & Publications
Duke Kunshan University, Wuhan University, and the University of Macau: Quantifying the Blockchain Trilemma: A Comparative Analysis of Algorand, Ethereum 2.0, and Beyond

July 19, 2024
Press & Publications
Technische Universität München: The Cost of Executing Business Processes on Next-Generation Blockchains: The Case of Algorand

June 9, 2024
Press & Publications
Electronics: Improving Election Integrity: Blockchain and Byzantine Generals Problem Theory in Vote Systems

May 9, 2024
Press & Publications
IEEE Transactions on Network and Service Management: Time Estimation for a New Block Generation in Blockchain-Enabled Internet of Things

February 9, 2024
View all