A course in computational algebraic number theory
The book describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. The detailed description of each algorithm allows immediate computer implementation; numerous further...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Libro |
| Lingua: | Undetermined |
| Pubblicazione: |
New York
Springer-Verlag
1996
|
| Soggetti: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| Riassunto: | The book describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. The detailed description of each algorithm allows immediate computer implementation; numerous further hints for implementation are also provided. The book also gives a survey of factoring and primality testing methods, including a detailed description of the number-field sieve algorithm. It ends with a description of available computer package and some useful tables. It contains a large number of exercises |
|---|