Sciweavers

19 search results - page 4 / 4
» On the least prime primitive root modulo a prime
Sort
View
ECCC
1998
118views more  ECCC 1998»
13 years 5 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan
ASIACRYPT
2003
Springer
13 years 10 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
LICS
2008
IEEE
13 years 11 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
MM
2004
ACM
136views Multimedia» more  MM 2004»
13 years 10 months ago
Fingerprinting and forensic analysis of multimedia
One of the prime reasons movie and music studios have ignored the Internet for open-networked multimedia content delivery, has been the lack of a technology that can support a sec...
Daniel Schonberg, Darko Kirovski