Previous | 
Home
Section: Bilateral Contracts and Grants with Industry
Training and Consulting with HTCS
The training and consulting activities begun in 2012 with the HTCS company have been pursued, and the existing contract has been renewed in identical form.
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
- Collecting Relation for the Number Field Sieve in Medium Characteristic
- Recent Progress on the Elliptic Curve Discrete Logarithm Problem
- A Modified Block Lanczos Algorithm with Fewer Vectors
- Factorization of RSA-220 with CADO-NFS
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Solving Discrete Logarithms on a 170-bit MNT Curve by Pairing Reduction
- Computing Jacobi's Theta in Quasi-linear Time
- Computing Theta Functions in Quasi-linear Time in Genus 2 and Above
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
- Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds
- Constructing Sparse Polynomial Systems with Many Positive Solutions
- Modular Arithmetic and ECM on the Kalray MPPA-256 Processor
- Determinism and Computational Power of Real Measurement-based Quantum Computation
- Fast Integer Multiplication Using Generalized Fermat Primes
- Search for Primitive Trinomials
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
- Collecting Relation for the Number Field Sieve in Medium Characteristic
- Recent Progress on the Elliptic Curve Discrete Logarithm Problem
- A Modified Block Lanczos Algorithm with Fewer Vectors
- Factorization of RSA-220 with CADO-NFS
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Solving Discrete Logarithms on a 170-bit MNT Curve by Pairing Reduction
- Computing Jacobi's Theta in Quasi-linear Time
- Computing Theta Functions in Quasi-linear Time in Genus 2 and Above
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
- Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds
- Constructing Sparse Polynomial Systems with Many Positive Solutions
- Modular Arithmetic and ECM on the Kalray MPPA-256 Processor
- Determinism and Computational Power of Real Measurement-based Quantum Computation
- Fast Integer Multiplication Using Generalized Fermat Primes
- Search for Primitive Trinomials
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography