19 search results - page 4 / 4 » On the least prime primitive root modulo a prime |
95
Voted
ECCC
1998
15 years 23 hour ago
1998
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 ...
123
Voted
ASIACRYPT
2003
Springer
15 years 5 months ago
2003
Springer
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...
88
Voted
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
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...
110
click to vote
MM
2004
ACM
15 years 5 months ago
2004
ACM
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...