Skip to Main content Skip to Navigation
New interface



 Exact Computing

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


Electromagnetic Analysis Coding and cryptography days 2014 Hamming distance Randomized algorithms Asymptotics Montgomery curve Functional encryption for inner products Cryptosystem In-place algorithm Mixed-radix number system Exact linear algebra Exponentiation Triangular set Correlation electromagnetic analysis Homomorphic encryption Error correcting codes Control flow divergence In-place arithmetic Algèbre linéaire exacte Bases d'approximant Algorithm Bornes combinatoires Online algorithm Arithmétique modulaire Linear code Cryptography based on class groups of an imaginary quadratic field Implementation library Class groups of quadratic imaginary number fields Malicious adversary Cauchy matrices Scalar multiplication Clustering Algorithms Journées codage et cryptographie 2014 Covering systems of congruences LinBox Polynomial root finding Calcul formel Correlation Electromagnetic Analysis Bivariate polynomial systems SIMD Finite field Correct rounding GPU computing Hensel lifting CADO-NFS Discrete circle Deterministic algorithm Implementation Certification Twisted Edwards curve Cryptographic primitives Arithmetic Polynomial Modular Number System Lefèvre algorithm Algorithme Domain Specific Language FFT Benchmarking Algorithms and containers Finite fields Matrix multiplication algorithms Digital straight segment recognition Codes correcteurs d'erreurs Supersingular isogeny Diffie-Hellman Cofactorization Analyse Hankel matrix Computations on polynomials Elementary function Mathemagix Complexity Analysis Encryption switching protocols Algebraic Coding Theory Fully Homomorphic Encryption Linearly homomorphic encryption Computer Algebra Dataflow Parallelism Bootstrapping Floating-point arithmetic Design pattern Linear system solving Computation on polynomials Efficient arithmetic Class group cryptography Arithmétique en place Side-channel attacks RSA Algorithmes Relaxed algorithm Collision Attacks Cutting Strategy Arithmetic complexity Polynomial multiplication Design of algorithms Graeffe transform Elliptic curve method Double-base representation Interleaved Reed Solomon codes Complexity Integer matrix multiplication