Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection

DOI10.1007/978-3-642-31912-9_21zbMath1369.94565OpenAlexW1518343622MaRDI QIDQ3166828

Douglas Stebila, Jothi Rangasamy, Lakshmi Kuppusamy, Juan Manuel González Nieto, Colin A. Boyd

Publication date: 1 November 2012

Published in: Information Security and Cryptology - ICISC 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31912-9_21

zbMATH Keywords

RSAtime-lock puzzlesclient puzzlesdenial of service resistancepuzzle difficulty

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Improved Cryptographic Puzzle Based on Modular Exponentiation

This page was built for publication: Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection