116 citations found. Retrieving documents...
E. Bach and J. Shallit, Algorithmic Number Theory, Vol. 1, MIT Press, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Generating Random Factored Numbers, Easily - Adam Kalai Akalai   Self-citation (Bach)   (Correct)

No context found.

E. Bach and J. Shallit, Algorithmic Number Theory, MIT Press, Cambridge, 1996.


On the Iteration of Certain Quadratic Maps - Over Gf Troy   Self-citation (Shallit)   (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory. MIT Press, 1996.


quant-ph/9911124 - Nov The Query   (Correct)

No context found.

E. Bach and J. Shallit, Algorithmic Number Theory, Vol. 1, MIT Press, 1996.


The query complexity of order-finding - Richard Cleve Department   (Correct)

No context found.

E. Bach and J. Shallit, Algorithmic Number Theory, Vol. 1, MIT Press, 1996.


Number Theory and Cryptography (using - Maple John Cosgrave   (Correct)

No context found.

Bach, E. and Shallit, J.: Algorithmic Number Theory. Volume 1. The MIT Press. (1996)


A Note on Quadratic Residuosity and UP - Cai, Threlfall (2004)   (Correct)

No context found.

E. Bach, J. Shallit, Algorithmic Number Theory, Vol. 1: E#cient Algorithms, MIT Press, Cambridge, Massachusetts, 1996.


SOME NEW RESULTS CONCERNING THE SMARANDACHE CEIL FUNCTION .. - University College Cork   (Correct)

No context found.

Bach, E. and Shallit, J. (1996) Algorithmic Number Theory, MIT Press, Cambridge, Massachusetts, USA.


Efficient Computation of Roots in Finite Fields - Barreto, Voloch (2004)   (Correct)

No context found.

Bach, E. and J. Shallit: 1996, Algorithmic Number Theory, Vol. 1. MIT Press.


Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin (2001)   (41 citations)  (Correct)

No context found.

Eric Bach and Je rey Shallit. Algorithmic Number Theory. MIT Press, Cambridge, MA, 1996.


Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999)   (76 citations)  (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory, volume 1. MIT Press, 1996.


Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001)   (38 citations)  (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory, volume 1. MIT Press, 1996.


Replication Is Not Needed: - Single Database..   (Correct)

No context found.

E. Bach, and J. Shallit. Algorithmic Number Theory (Volume 1). MIT Press, 1996.


An Analysis of the Reduction Algorithms for Binary Quadratic.. - Biehl, Buchmann (1997)   (4 citations)  (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic number theory. MIT Press, Cambridge, Massachusetts and London, England, 1996.


Approximate Evaluation of L(1, χ_Δ) - Buchmann, Maurer (1998)   (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic number theory. MIT Press, Cambridge, Massachusetts and London, England, 1996.


A One Way Function Based on Ideal Arithmetic in Number Fields - Buchmann, Paulus (1997)   (6 citations)  (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic number theory. MIT Press, Cambridge, Massachusetts and London, England, 1996.


State Complexity Of Proportional Removals - Domaratzki (2002)   (Correct)

No context found.

E. Bach, J. Shallit, Algorithmic Number Theory, Volume I: E#cient Algorithms. MIT Press, Cambridge, Mass., 1996.


Choosing Numbers for the Properties of Their - Squares Michael De (2004)   (Correct)

No context found.

Eric Bach and Je#rey Shallit. Algorithmic Number Theory, Volume 1 E#cient Algorithms. MIT Press, Cambridge, Mass., 1997.


A Better Wake-up in Radio Networks - Chlebus, Kowalski (2004)   (1 citation)  (Correct)

No context found.

E. Bach, and J. Shallit, "Algorithmic Number Theory," Vol. I, 1996, The MIT Press, Cambridge, Massachusetts.


Polynomial Interpolation of Cryptographic Functions Related.. - Kiltz, Winterhof (2003)   (Correct)

No context found.

E. Bach and J. O. Shallit, Algorithmic number theory, Vol.1: Efficient algorithms. MIT Press, Cambridge, 1996.


Periodicity and Repetition in Combinatorics on Words - Wang (2004)   (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory. The MIT Press, 1996.


Monoids and the State Complexity of the Operation root(L) - Krawetz (2003)   (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory, Volume 1: E#cient Algorithms. The MIT Press, 1996.


On Protocol Security in the Cryptographic Model - Nielsen (2003)   (1 citation)  (Correct)

No context found.

Eric Bach and Je#rey Shallit. Algorithmic Number Theory, Volume I: E#cient Algorithms. MIT Press, August 1996.


New Approaches to Password Authenticated Key Exchange based on RSA - Zhang (2004)   (1 citation)  (Correct)

No context found.

E. Bach and J. Shallit, Algorithmic Number Theory, vol. 1: Ecient Algorithms, MIT Press, 1997.


Complexity Theoretic Lower Bounds on Cryptographic Functions - Kiltz   (Correct)

No context found.

E. Bach and J. Shallit. Algorithmic Number Theory, Volume I: E#cient Algorithms. MIT Press, August 1996.


Non-approximability of the Permanent of Structured.. - Codenotti, Shparlinski (2002)   (Correct)

No context found.

E. Bach and J. Shallit, Algorithmic number theory , MIT Press, 1996.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC