all_field.C | |
chineseremainder.h | Chinese Remainder Algorithm for 2 Elements |
domain_to_operatorstyle.C | |
exponentiation.C | |
extension.h | NO DOX |
ff_arith.C | |
GF128.C | |
GFirreducible.C | |
gfq.h | Arithmetic on GF(p^k), with p a prime number less than 2^16 |
gfq_atomic.C | |
gfqext.h | Arithmetic on GF(p^k), with p a prime number less than 2^15. Specialized for fast conversions to floating point numbers. Main difference in interface is init/convert |
gfqkronecker.h | Arithmetic on GF(p^k), with dynamic Kronecker substitution |
givaromm.h | Memory management in Givaro two memory managers: |
givarray0.h | Array of type T with reference mecanism |
givarrayallocator.h | NO DOC |
givarrayfixed.h | ArrayFixed of type T with fixed dimension |
givbasictype.h | NO DOC |
givbits.h | Field of n bits, for any n |
givcaster.h | NO DOC |
givconfig.h | Configuration file for Givaro |
givdegree.h | NO DOC opaque class for Degree of polynomial. Degree of polynomial 0 is Degree::deginfty with value DEGPOLYZERO |
givelem.h | Definition of a reference to an object |
giverror.h | Error exception |
givgenarith.h | Domain definition for basic type of the language |
givhashtable.h | Hash table |
givindeter.h | Indeterminates for polynomial manipulation |
givinit.h | NO DOC |
givinteger.h | Integer Domain class definition |
givinterp.h | NO DOC |
givinterpgeom-multip.h | Interpolation at geometric points |
givinterpgeom.h | Interpolation at geometric points |
givintfactor.h | Factorisation |
givintnumtheo.h | Num theory |
givintprime.h | Primes |
givintrns.h | Arithmetic for RNS representations. Modular arithmetic for GIVARO. Here is defined arithmetic functions on rns representation with Givaro Integers |
givintrsa.h | RSA scheme |
givintsqrootmod.h | Modular square roots |
givlist0.h | List of type T with double link and various insert/get/rmv method. Used reference counting on each node of the list |
givmodule.h | NO DOC |
givperf.h | Performance analysis |
givpointer.h | Auto ptr management |
givpoly1.h | NO DOC |
givpoly1crt.h | Polynomial Chinese Remaindering of degree 1 |
givpoly1dense.h | Univariate polynomial over T. we assume that T is a ring (0,1,+,*) |
givpoly1factor.h | NO DOC |
givpoly1padic.h | NO DOC |
givpower.h | NO DOC |
givprimes16.h | Set of primes less than 2^16 |
givprint.h | |
givranditer.h | NO DOC Givaro ring Elements generator |
givrandom.h | NO DOC |
givrational.h | Rationals (and domain), composed of an integer (numerator), and a positive integer (denominator) NO DOC |
givref_count.h | Definition of the Counter class, Counter. This class definition objects to handle reference counter for memory allocation (eg array0) |
givrns.h | Modular arithmetic for GIVARO. Here is defined arithmetic functions on rns representation and interface between RNS and Integer, all is done via the Chinese Remainder Algorithm |
givrnsfixed.h | Chinese Remainder Algorithm |
givstack.h | No doc |
givtimer.h | Timer |
gmp++_int.h | |
gmp++_int_add.C | |
gmp++_int_compare.C | Routines to compare integers |
gmp++_int_cstor.C | |
gmp++_int_div.C | |
gmp++_int_gcd.C | |
gmp++_int_io.C | |
gmp++_int_lib.C | |
gmp++_int_misc.C | |
gmp++_int_mod.C | |
gmp++_int_mul.C | |
gmp++_int_pow.C | |
gmp++_int_rand.inl | |
gmp++_int_sub.C | |
highorder.C | |
iexponentiation.C | |
ifactor.C | |
ifactor_lenstra.C | |
igcd.C | |
igcdext.C | |
ilcm.C | |
interpolate.C | |
iratrecon.C | |
isirred.C | |
ispower.C | |
isprimitive.C | |
isproot.C | |
lambda.C | |
lambda_inv.C | |
modular-implem.h | Generic implementation of Modular |
modular-integral.h | Representation of Z/mZ over int types |
modular.h | Family of arithmetics over Zpz ( ) |
ModularSquareRoot.C | |
montgomery.h | Family of arithmetics over Zpz ( ) |
nb_primes.C | |
nextprime.C | |
order.C | |
phi.C | |
pol_arith.C | |
pol_eval.C | |
pol_factor.C | |
polydouble.C | |
PolynomialCRT.C | |
prevprime.C | |
primitiveelement.C | |
primitiveroot.C | |
probable_primroot.C | |
ProbLucas.C | |
RSA_breaking.C | |
RSA_decipher.C | |
RSA_encipher.C | |
RSA_keys_generator.C | |
StaticElement.h | NO DOC |
test-crt.C | NO DOC |
test-integer.C | |
test-modsqroot.C | NO DOC |
test-random.C | We test bounds for random Integers |
Test_Extension.C | |
trunc_arith.C | |
zpz_atomic.C | |