Project-Team:CARAMBA

Project-Team Caramba

Members

Overall Objectives

Overall Objectives
Scientific Grounds

Research Program

The Extended Family of the Number Field Sieve
Algebraic Curves in Cryptology
Computer Arithmetic
Polynomial Systems

Application Domains

Better Awareness and Avoidance of Cryptanalytic Threats
Promotion of Better Cryptography
Key Software Tools

Highlights of the Year

New Software and Platforms

Belenios
Kalray-ECM
TinyGB

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

Training and Consulting with HTCS

Partnerships and Cooperations

National Initiatives

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Publications of the year
References in notes

Inria | Raweb 2016 | Presentation of the Project-Team CARAMBA | CARAMBA Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: Highlights of the Year

Highlights of the Year

The Caramba project-team was created on January 1st, 2016!

In October 2016, Pierrick Gaudry and Emmanuel Thomé, together with colleagues from the University of Pennsylvania (USA), have performed a discrete logarithm computation of a 1024-bit trapdoored prime [18].

Previous |

Home | Next next