Sciweavers

52 search results - page 11 / 11
» Is There a Shortage of Primes for Cryptography
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 6 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ARESEC
2011
117views more  ARESEC 2011»
12 years 5 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve