Algorithms and containers FFT Randomized algorithms Complexity Efficient arithmetic Dataflow Parallelism Multiplication of power series Scalar multiplication Design pattern Minimal approximant basis Hamming distance Cofactorization Bootstrapping Algorithm Floating-point arithmetic Modular multiplication Twisted Edwards curve Computations on polynomials Integer matrix multiplication In-place arithmetic Mathemagix Matrix multiplication algorithms Montgomery Exponentiation Relaxed algorithm Montgomery curve Encryption switching protocols Deterministic algorithm Polynomial root finding Calcul formel Mixed Integer Linear Programming Arithmetic Non-linear code Polynomial multiplication Bases d'approximant Certification In-place algorithm Journées codage et cryptographie 2014 Correlation Electromagnetic Analysis Linear system solving Analyse Malicious adversary Discrete circle Double-base representation Bornes combinatoires GPU computing Order basis Triangular set Covering systems of congruences Lefèvre algorithm Clustering Algorithms Arithmetic complexity Order bases Asymptotics Algorithme Exponentiation Cutting Strategy Coding and cryptography days 2014 Middle product Online algorithm Arithmétique modulaire Hankel matrix CADO-NFS Finite fields Algèbre linéaire exacte Fully Homomorphic Encryption Domain Specific Language Cauchy matrices Computation on polynomials Design of algorithms Algorithmes Homomorphic encryption Arithmétique en place Modular composition Collision Attacks RSA Elementary function Mixed-radix number system Correct rounding Control flow divergence Algebraic Coding Theory Implementation Minimal basis Computer Algebra Finite field Complexity Analysis Elliptic curve method OpenCL Hensel lifting Side-channel attacks Graeffe transform SIMD Bivariate polynomial systems Linear code Matrix polynomial Digital straight segment recognition Exact linear algebra Benchmarking Electromagnetic Analysis LinBox Correlation electromagnetic analysis