C2Puzzle: A Novel Computational Client Puzzle for Network Security

Abstract

Client puzzles, a type of cryptographic puzzle, have been proposed and developed by many scholars to guarantee network security. In this paper, we proposed C2Puzzle, a novel computational client puzzle. By using the iterative algorithm, C2Puzzle successfully combined the basic principles of prime factorization and discrete logarithm problem. We show that, C2Puzzle has the visible security advantages, and the adjustability of puzzle difficulty is in fine granularity.