 all_field.C | |
 bstruct.doxy | |
 config.h | |
 domain_to_operatorstyle.C | |
 dummy.C | |
 exponentiation.C | |
 ff_arith.C | |
 GaloisFields.C | |
 GF128.C | |
 GFirreducible.C | |
 gfq_atomic.C | |
 giv_randiter.h | NO DOC Givaro field Elements generator |
 givarithmetics.h | |
 givaro-config.h | |
 givaro.doxy | |
 givaromm.C | |
 givaromm.h | Memory management in Givaro two memory managers: |
 givarray0.h | Array of type T with reference mecanism |
 givarray0.inl | |
 givarrayallocator.h | NO DOC |
 givarrayfixed.h | ArrayFixed of type T with fixed dimension |
 givbasictype.C | |
 givbasictype.h | NO DOC |
 givbits.C | |
 givbits.h | Field of n bits, for any n |
 givbits.inl | |
 givcaster.h | NO DOC |
 givcategory.h | |
 givconfig.h | Configuration file for Givaro |
 givcra.h | Chinese Remainder Algorithm for 2 Elements |
 givdegree.C | |
 givdegree.h | NO DOC opaque class for Degree of polynomial |
 givelem.h | Definition of a reference to an object |
 giverror.C | |
 giverror.h | Error exception |
 givextension.h | NO DOX |
 givfixedtrunc.h | |
 givfractiondomain.h | |
 givgenarith.h | Domain definition for basic type of the language |
 givgfq.h | Arithmetic on GF(p^k), with p a prime number less than 2^16 |
 givgfq.inl | |
 givgfqext.h | Arithmetic on GF(p^k), with p a prime number less than 2^15 |
 givgfqkron.h | Arithmetic on GF(p^k), with dynamic Kronecker substitution |
 givhashtable.h | Hash table |
 givhashtable.inl | |
 givhighorder.h | |
 givindeter.C | |
 givindeter.h | Indeterminates for polynomial manipulation |
 givinit.C | |
 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 |
 givintfactor.inl | |
 givintnumtheo.h | Num theory |
 givintnumtheo.inl | |
 givintprime.C | |
 givintprime.h | Primes |
 givintprime.inl | |
 givintrns.h | Arithmetic for RNS representations |
 givintrns_convert.inl | |
 givintrns_cstor.inl | NO DOC |
 givintrsa.h | RSA scheme |
 givintrsa.inl | |
 givintsqrootmod.h | Modular square roots |
 givintsqrootmod.inl | |
 giviterator.h | |
 givlist0.h | List of type T with double link and various insert/get/rmv method |
 givlist0.inl | |
 givmatdense.h | |
 givmatdenseops.inl | |
 givmatrix.C | |
 givmatrix.h | |
 givmatsparse.h | |
 givmatsparseops.inl | |
 givmatstorage.h | |
 givmatstoragedense.h | |
 givmatstoragesparse.h | |
 givmodule.C | |
 givmodule.h | NO DOC |
 givmontg32.C | |
 givmontg32.h | NO DOC |
 givmontg32.inl | |
 givops.C | |
 givops.h | |
 givperf.h | Performance analysis |
 givpointer.h | Auto ptr management |
 givpoly1.h | NO DOC |
 givpoly1addsub.inl | |
 givpoly1axpy.inl | |
 givpoly1crt.h | Polynomial Chinese Remaindering of degree 1 |
 givpoly1crtconvert.inl | |
 givpoly1crtcstor.inl | |
 givpoly1cstor.inl | |
 givpoly1cyclo.inl | |
 givpoly1dense.h | Univariate polynomial over T |
 givpoly1denseops.inl | |
 givpoly1factor.h | NO DOC |
 givpoly1factor.inl | |
 givpoly1gcd.inl | |
 givpoly1io.inl | |
 givpoly1kara.inl | |
 givpoly1misc.inl | |
 givpoly1muldiv.inl | |
 givpoly1padic.h | NO DOC |
 givpoly1proot.inl | |
 givpoly1ratrecon.inl | |
 givpoly1sqrfree.inl | |
 givpower.h | NO DOC |
 givprimes16.C | |
 givprimes16.h | Set of primes less than 2^16 |
 givquotientdomain.h | |
 givrandom.h | NO DOC |
 givrataddsub.C | |
 givratcompare.C | |
 givratcpy.C | |
 givratcstor.C | |
 givratio.C | |
 givrational.h | Rationals (and domain) NO DOC |
 givrational.inl | |
 givratmisc.C | |
 givratmuldiv.C | |
 givratreconstruct.C | |
 givref_count.h | Definition of the Counter class, Counter |
 givrns.h | Modular arithmetic for GIVARO |
 givrnsconvert.inl | |
 givrnscstor.inl | |
 givrnsfixed.h | Chinese Remainder Algorithm |
 givrnsfixed.inl | |
 givstack.h | No doc |
 givstack.inl | |
 givstorage.h | |
 givstoragedense.h | |
 givtablelimits.C | |
 givtablelimits.h | Zech extension |
 givtimer.C | |
 givtimer.h | Timer |
 givtruncdomain.h | |
 givtruncdomain.inl | |
 givvectdenseops.inl | |
 givvectdensespe.inl | |
 givvector.h | |
 givvectordense.inl | |
 givvectorsparse.h | |
 givvectorsparse.inl | |
 givvectsparseops.inl | |
 givzpz.h | Family of arithmetics over Zpz ( ) |
 givzpz16std.C | |
 givzpz16std.h | Arithmetic on Z/pZ, with p a prime number less than 2^14 |
 givzpz16std.inl | |
 givzpz16table1.C | |
 givzpz16table1.h | Arithmetic on Z/pZ, with tabulation of operations |
 givzpz16table1.inl | |
 givzpz32std.C | |
 givzpz32std.h | Arithmetic on Z/pZ , with p a prime number less than  |
 givzpz32std.inl | |
 givzpz32uns.C | |
 givzpz32uns.h | Arithmetic on Z/pZ, with p a prime number less than 2^32 |
 givzpz32uns.inl | |
 givzpz64std.C | |
 givzpz64std.h | Zpz on 64bit words Arithmetic on Z/pZ, with p a prime number less than 2^64 Modulo typedef is a signed long number |
 givzpz64std.inl | |
 givzpzGen.h | |
 givzpzGen.inl | |
 givzpzInt.h | Arithmetic on Z/pZ, with p a prime number in arbitrary precision |
 givzpzInt.inl | |
 givzpztypes.h | Family of types for arithmetic over Zpz |
 gmp++.doxy | |
 gmp++.h | |
 gmp++_int.C | |
 gmp++_int.h | Core gmp++_int.h |
 gmp++_int_add.C | Adding stuff |
 gmp++_int_compare.C | Routines to compare integers |
 gmp++_int_cstor.C | Cstoring stuff |
 gmp++_int_div.C | Diving stuff |
 gmp++_int_gcd.C | Gcding stuff |
 gmp++_int_io.C | Ioing stuff |
 gmp++_int_lib.C | Libing stuff |
 gmp++_int_misc.C | Miscing stuff |
 gmp++_int_mod.C | Moding stuff |
 gmp++_int_mul.C | Muling stuff |
 gmp++_int_pow.C | Powing stuff |
 gmp++_int_rand.inl | Randing stuff |
 gmp++_int_sub.C | Subing stuff |
 gmp++_rat.C | |
 gmp++_rat.h | Core Rationel from GMP |
 gmp++_rat.inl | |
 gmp++_rat_add.C | |
 gmp++_rat_compare.C | Routines to compare integers |
 gmp++_rat_cstor.C | |
 gmp++_rat_io.C | |
 gmp++_rat_misc.C | |
 highorder.C | |
 iexponentiation.C | |
 ifactor.C | |
 ifactor_lenstra.C | |
 igcd.C | |
 igcdext.C | |
 ilcm.C | |
 integer.doxy | |
 interpolate.C | |
 iratrecon.C | |
 isirred.C | |
 ispower.C | |
 isprime.C | |
 isprimitive.C | |
 isproot.C | |
 lambda.C | |
 lambda_inv.C | |
 mainpage.doxy | |
 memory.doxy | |
 ModularSquareRoot.C | |
 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 | |
 rational.doxy | |
 RSA_breaking.C | |
 RSA_decipher.C | |
 RSA_encipher.C | |
 RSA_keys_generator.C | |
 StaticElement.h | NO DOC |
 system.doxy | |
 test-conversion.C | |
 test-crt.C | NO DOC |
 test-ffarith.C | |
 test-geom.C | |
 test-ifactor.C | |
 test-integer.C | Tests integer.h fucntions not tested elsewhere |
 test-mod.C | |
 test-modsqroot.C | NO DOC |
 test-random.C | We test bounds for random Integers |
 test-ratrecon.C | |
 test-ringarith.C | |
 test-trunc.C | |
 Test_Extension.C | |
 trunc_arith.C | |
 zpz.doxy | |
 zpz_atomic.C | |