Top
Back: Teaching
Forward: schnellexpt
FastBack: System and Control theory
FastForward: atkins_lib
Up: Teaching
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.11.1 aksaka_lib

Library:
aksaka.lib
Purpose:

Procedures for primality testing after Agrawal, Saxena, Kayal

Authors:
Christoph Mang

Overviev:
Algorithms for primality testing in polynomial time based on the ideas of Agrawal, Saxena and Kayal.

Procedures:

D.11.1.1 schnellexpt  a^m for numbers a,m; if a^k>n n+1 is returned
D.11.1.2 log2  logarithm to basis 2 of n
D.11.1.3 PerfectPowerTest  checks if there are a,b>1, so that a^b=n
D.11.1.4 wurzel  square root of number r
D.11.1.5 euler  phi-function of euler
D.11.1.6 coeffmod  poly f modulo number n (coefficients mod n)
D.11.1.7 powerpolyX  (poly a)^q modulo (poly r,number n)
D.11.1.8 ask  ASK-Algorithm; deterministic Primality test


Top Back: Teaching Forward: schnellexpt FastBack: System and Control theory FastForward: atkins_lib Up: Teaching Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-0-3, May 2007, generated by texi2html.