Skip to Main content
Skip to Navigation
Toggle navigation
HAL
HAL
HALSHS
TEL
MédiHAL
Liste des portails
AURéHAL
API
Data
Documentation
Episciences.org
Episciences.org
Journals
Documentation
Sciencesconf.org
Support
Sign in
Sign in
Sign in with ORCID
se connecter avec Fédération
Create account
Forgot your password?
Have you forgotten your login?
fr
en
ECO
Homepage
Deposit
Browse
by author
by period
by docType
by journal
by conference
by ANR project
latest submissions
Evaluation
Homepage
Search
ECO
Exact Computing
Consult your copyright
Titre du journal ou ISSN
Editeur
Number of Files
52
Nomber of Notices
17
Collaborations’ map
Tags
Floating-point arithmetic
Scalar multiplication
Digital straight segment recognition
Matrix multiplication algorithms
Bootstrapping
Certification
In-place arithmetic
Implementation
Collision Attacks
Cofactorization
Matrix polynomial
Arithmétique en place
Mixed Integer Linear Programming
Clustering Algorithms
OpenCL
Computer Algebra
Discrete circle
Deterministic algorithm
Bornes combinatoires
Algèbre linéaire exacte
Benchmarking
GPU computing
Cauchy matrices
Side-channel attacks
Algorithmes
Correlation Electromagnetic Analysis
Exact linear algebra
Non-linear code
Hankel matrix
Montgomery Exponentiation
LinBox
RSA
Integer matrix multiplication
Cutting Strategy
Algorithm
Double-base representation
FFT
Exponentiation
Computation on polynomials
Hensel lifting
Electromagnetic Analysis
Relaxed algorithm
Multiplication of power series
Complexity Analysis
Twisted Edwards curve
Elementary function
Arithmétique modulaire
Algorithms and containers
Mathemagix
P-Adic integer
Design pattern
Graeffe transform
Polynomial root finding
Mixed-radix number system
Design of algorithms
Algebraic Coding Theory
Calcul formel
Covering systems of congruences
Correlation electromagnetic analysis
Analyse
Montgomery curve
Coding and cryptography days 2014
Linear system solving
Minimal basis
Triangular set
Elliptic curve method
Algorithme
Online algorithm
SIMD
Minimal approximant basis
Domain Specific Language
Bivariate polynomial systems
Homomorphic encryption
Hamming distance
CADO-NFS
Correct rounding
Fully Homomorphic Encryption
Arithmetic
Encryption switching protocols
Finite field
Randomized algorithms
Bases d'approximant
Order bases
Linear code
Dataflow Parallelism
Modular multiplication
Computations on polynomials
Finite fields
Modular composition
Order basis
Polynomial multiplication
Malicious adversary
Arithmetic complexity
Control flow divergence
Journées codage et cryptographie 2014
Asymptotics
In-place algorithm
Middle product
Complexity
Lefèvre algorithm