×

Found 151 Documents (Results 1–100)

Extending the binary gcd algorithms. (English) Zbl 1014.11079

Alster, Kazimierz (ed.) et al., Public-key cryptography and computational number theory. Proceedings of the international conference organized by the Stefan Banach International Mathematical Center, Warsaw, Poland, September 11-15, 2000. Berlin: de Gruyter. 113-135 (2001).
Reviewer: H.J.Godwin (Egham)
MSC:  11Y16 11-04
PDFBibTeX XMLCite

The Euclidean algorithm in cubic number fields. (English) Zbl 0918.11057

Győry, Kálmán (ed.) et al., Number theory. Diophantine, computational and algebraic aspects. Proceedings of the international conference, Eger, Hungary, July 29–August 2, 1996. Berlin: de Gruyter. 123-146 (1998).
Reviewer: H.J.Godwin (Egham)
MSC:  11R16 11Y40
PDFBibTeX XMLCite
Full Text: arXiv

From the Karatsuba method for fast multiplication on numbers to fast algorithms for discrete functions. (English. Russian original) Zbl 0929.11062

Lupanov, O. B. (ed.), Analytic number theory and applications. Collected papers in honor of the sixtieth birthday of Professor Anatolii Alexeevich Karatsuba. Moscow: MAIK Nauka/Interperiodica Publishing, Proc. Steklov Inst. Math. 218, 15-22 (1997); translation from Tr. Mat. Inst. Steklova 218, 20-27 (1997).
Reviewer: H.J.Godwin (Egham)
MSC:  11Y16 68Q25
PDFBibTeX XMLCite

Models for parallel computation with real numbers. (English) Zbl 0921.68056

van der Poorten, Alf J. (ed.) et al., Proceedings of the international conference on number theoretic and algebraic methods in computer science, NTAMCS ’93, Moscow, Russia, June/July 1993. Singapore: World Scientific. 53-63 (1995).
Reviewer: H.J.Godwin (Egham)
PDFBibTeX XMLCite

Finding roots of unity among quotients of the roots of an integral polynomial. (English) Zbl 0924.11103

Levelt, A. H. M. (ed.), Proceedings of the 1995 international symposium on symbolic and algebraic computation, ISSAC ’95, Montreal, Canada, July 10–12, 1995. New York, NY: ACM Press. 85-89 (1995).
Reviewer: H.J.Godwin (Egham)
PDFBibTeX XMLCite

Under the assumption of the generalized Riemann hypothesis verifying the class number belongs to \(\text{NP}\cap\text{co-NP}\). (English) Zbl 0833.11061

Adleman, Leonard M. (ed.) et al., Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 877, 234-247 (1994).
Reviewer: H.J.Godwin (Egham)
MSC:  11Y16 11R29
PDFBibTeX XMLCite

An analysis of the Gaussian algorithm for lattice reduction. (English) Zbl 0841.11063

Adleman, Leonard M. (ed.) et al., Algorithmic number theory. 1st international symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 877, 144-158 (1994).
Reviewer: H.J.Godwin (Egham)
PDFBibTeX XMLCite

Massively parallel elliptic curve factoring. (English) Zbl 0811.11078

Rueppel, Rainer A. (ed.), Advances in cryptology – EUROCRYPT ’92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings. Berlin: Springer- Verlag. Lect. Notes Comput. Sci. 658, 183-193 (1993).
Reviewer: H.J.Godwin (Egham)
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software