|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 44 occurrences of 30 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Pedro Berrizbeitia, S. Müller, Hugh C. Williams |
Pseudocubes and Primality Testing.  |
ANTS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Manindra Agrawal, Somenath Biswas |
Primality and identity testing via Chinese remaindering.  |
J. ACM  |
2003 |
DBLP DOI BibTeX RDF |
Primality testing, polynomial identity testing |
| 2 | Manindra Agrawal, Somenath Biswas |
Primality and Identity Testing via Chinese Remaindering.  |
FOCS  |
1999 |
DBLP DOI BibTeX RDF |
Primality testing, Polynomial identity testing |
| 2 | Adam L. Young, Moti Yung |
Finding Length-3 Positive Cunningham Chains.  |
ANTS  |
1998 |
DBLP DOI BibTeX RDF |
Cunningham Chains, Auto-Recoverable and Auto-Certifiable Cryptosystem, ElGamal system, Public-Key Cryptosystems, Primality testing |
| 2 | Siguna Müller |
A Note on Strong Dickson Pseudoprimes.  |
Appl. Algebra Eng. Commun. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
Carmichael numbers, Dickson pseudoprimes, Euler pseudoprimes, Carmichael Lucas pseudoprimes, Dickson polynomials, Lucas sequences, Primality testing |
| 2 | Dan Boneh, Matthew K. Franklin |
Efficient Generation of Shared RSA Keys (Extended Abstract).  |
CRYPTO  |
1997 |
DBLP DOI BibTeX RDF |
RSA, Threshold Cryptography, Multiparty computation, Primality testing |
| 2 | Wieb Bosma, Marc-Paul van der Hulst |
Faster Primality Testing (Extended Abstract).  |
EUROCRYPT  |
1989 |
DBLP DOI BibTeX RDF |
|
| 2 | Pierre Beauchemin, Gilles Brassard, Claude Crépeau |
Two Observations on Probabilistic Primality Testing.  |
CRYPTO  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Noureldien Abdelrhman Noureldien, Mahmud Awadelkariem, DeiaEldien M. Ahmed |
A Detrministic Factorization and Primality Testing Algorithm for Integers of the Form Z Mod 6 = -1.  |
ISA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Song Y. Yan |
Primality Testing and Integer Factorization in Public-Key Cryptography  |
|
2009 |
DOI RDF |
|
| 1 | Qi Cheng |
Primality Proving via One Round in ECPP and One Iteration in AKS.  |
J. Cryptology  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Katz |
Review of "Primality Testing in Polynomial Time by Martin Dietzfelbinger", Springer-Verlag, 2004.  |
SIGACT News  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Joye, Pascal Paillier |
Fast Generation of Prime Numbers on Portable Devices: An Update.  |
CHES  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Audebaud, Christine Paulin-Mohring |
Proofs of Randomized Algorithms in Coq.  |
MPC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David S. Johnson |
The NP-completeness column.  |
ACM Transactions on Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
lattice bases, NP-completeness, coding theory, perfect graphs, primality testing, open problems |
| 1 | Jin-yi Cai, Hong Zhu |
Progress in Computational Complexity Theory.  |
J. Comput. Sci. Technol.  |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
| 1 | Alan R. Woods |
Subset sum "cubes" and the complexity of primality testing.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"  |
|
2004 |
DOI RDF |
|
| 1 | Charlie Obimbo, Stephen Doxsee |
The Threat of a Deterministic Polynomial Time Algorithm for Primality Testing in Applied Cryptography.  |
MSV/AMCS  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Qi Cheng |
Constructing finite field extensions with large order elements.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Kaltofen |
Polynomial factorization: a success story.  |
ISSAC  |
2003 |
DBLP DOI BibTeX RDF |
black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program |
| 1 | Manindra Agrawal |
On Derandomizing Tests for Certain Polynomial Identities.  |
IEEE Conference on Computational Complexity  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Cheng |
Primality Proving via One Round in ECPP and One Iteration in AKS.  |
CRYPTO  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik W. Lenstra Jr. |
Primality Testing with Gaussian Periods.  |
FSTTCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Avi Wigderson |
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.  |
RANDOM  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Matthew K. Franklin |
Efficient generation of shared RSA keys.  |
J. ACM  |
2001 |
DBLP DOI BibTeX RDF |
RSA, threshold cryptography, Multiparty computation, primality testing |
| 1 | Marc Joye, Pascal Paillier, Serge Vaudenay |
Efficient Generation of Prime Numbers.  |
CHES  |
2000 |
DBLP DOI BibTeX RDF |
Prime number generation, crypto-processors, smart-cards, RSA, DSA, key generation, fast implementations |
| 1 | Shafi Goldwasser, Joe Kilian |
Primality Testing Using Elliptic Curves.  |
J. ACM  |
1999 |
DBLP DOI BibTeX RDF |
distribution of primes, prime certification, prime generation, elliptic curves, group theory, primes, Las Vegas algorithms |
| 1 | Preda Mihailescu |
Cyclotomy Primality Proving - Recent Developments.  |
ANTS  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard M. Adleman |
Algorithmic Number Theory and Its Relationship to Computational Complexity.  |
Computer Science Today  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Arazi |
On Primality Testing using Purely Divisionless Operations.  |
Comput. J.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard M. Adleman |
Algorithmic Number Theory-The Complexity Contribution  |
FOCS  |
1994 |
DBLP DOI BibTeX RDF |
algorithmic number theory, computational complexity, factoring, primality testing, open problems |
| 1 | René Peralta, Victor Shoup |
Primality Testing with Fewer Random Bits.  |
Computational Complexity  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Lidl, Winfried B. Müller |
Primality Testing with Lucas Functions.  |
AUSCRYPT  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Davenport |
Primality Testing Revisited.  |
ISSAC  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Winfried B. Müller, Alan Oswald |
Dickson Pseudoprimes and Primality Testing.  |
EUROCRYPT  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | François Morain |
Atkin's Test: News From the Front.  |
EUROCRYPT  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer |
Deterministic and Las Vegas Primality Testing Algorithms.  |
ICALP  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Deh A. Huang |
On a Simple Primality Testing Algorithm.  |
EUROSAM  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | James Finn, Karl J. Lieberherr |
Primality Testing and Factoring.  |
Theor. Comput. Sci.  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonard M. Adleman |
Primality Testing.  |
CRYPTO  |
1981 |
DBLP BibTeX RDF |
|
| 1 | Louis Monier |
Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms.  |
Theor. Comput. Sci.  |
1980 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|