World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
5688
World Ranking
10293
National Ranking
248

Overview

Jean-Pierre Tillich is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research primarily spans computer science, with a focus on artificial intelligence, computational theory and mathematics, electrical and electronic engineering, computer networks and communications, and molecular biology.

The scientist's main research topics include coding theory and cryptography, cryptographic implementations and security, cryptography and data security, polynomial and algebraic computation, graph theory and CDMA systems, quantum computing algorithms and architecture, and cellular automata and applications.

Frequent co-authors include Magali Bardet, Rocco Mora, Thomas Debris-Alazard, Kévin Carrier, and Maxime Bros. Their publication venues reflect their research focus, with multiple papers published in arXiv (Cornell University), Designs Codes and Cryptography, IEEE Transactions on Information Theory, HAL (Le Centre pour la Communication Scientifique Directe), and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Recent papers authored or co-authored by Jean-Pierre Tillich cover various areas in algebraic attacks and coding theory. These include:

  • "Revisiting algebraic attacks on MinRank and on the rank decoding problem", 2023, Designs Codes and Cryptography
  • "On the dimension and structure of the square of the dual of a Goppa code", 2022, Designs Codes and Cryptography
  • "Smoothing Codes and Lattices: Systematic Study and New Bounds", 2023, IEEE Transactions on Information Theory
  • "Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems", 2020, HAL (Le Centre pour la Communication Scientifique Directe)
  • "Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes", 2023, IEEE Transactions on Information Theory

Jean-Pierre Tillich has contributed to book publications with Springer Science+Business Media, including multiple editions of "Post-Quantum Cryptography" published in 2020 and 2021.

Best Publications

  • MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes

    Rafael Misoczki;Jean-Pierre Tillich;Nicolas Sendrier;Paulo S. L. M. Barreto

  • A Distinguisher for High-Rate McEliece Cryptosystems

    Jean-Charles Faugere;Valerie Gauthier-Umana;Ayoub Otmani;Ludovic Perret

  • Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}

    Jean-Pierre Tillich;Gilles Zemor

  • Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

    Jean-Pierre Tillich;Gilles Zemor

  • Algebraic cryptanalysis of mceliece variants with compact keys

    Jean-Charles Faugère;Ayoub Otmani;Ludovic Perret;Jean-Pierre Tillich

  • Algebraic properties of polar codes from a new polynomial formalism

    Magali Bardet;Vlad Dragoi;Ayoub Otmani;Jean-Pierre Tillich

  • Distinguisher-based attacks on public-key cryptosystems using Reed---Solomon codes

    Alain Couvreur;Philippe Gaborit;Valérie Gauthier-Umaña;Ayoub Otmani

  • Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes

    Ayoub Otmani;Jean-Pierre Tillich;Léonard Dallot

  • Quantum Serial Turbo Codes

    D. Poulin;J.-P. Tillich;H. Ollivier

  • Description of a quantum convolutional code.

    Harold Ollivier;Jean-Pierre Tillich

  • Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

    Alain Couvreur;Ayoub Otmani;Jean-Pierre Tillich

  • BIKE: Bit Flipping Key Encapsulation

    Nicolas Aragon;Paulo Barreto;Slim Bettaieb;Loïc Bidoux

  • Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems

    Magali Bardet;Maxime Bros;Daniel Cabarcas;Philippe Gaborit

  • A New Algorithm for Solving the Rank Syndrome Decoding Problem

    Nicolas Aragon;Philippe Gaborit;Adrien Hauteville;Jean-Pierre Tillich

  • Quantum convolutional codes: fundamentals

    H. Ollivier;Jean-Pierre Tillich

  • Quantum Expander Codes

    Anthony Leverrier;Jean-Pierre Tillich;Gilles Zemor

  • Accurate estimates of the data complexity and success probability for various cryptanalyses

    Céline Blondeau;Benoît Gérard;Jean-Pierre Tillich

  • 2011 IEEE Information Theory Workshop, ITW 2011

    Jean Charles Faugère;Jean Charles Faugère;Valérie Gauthier-Umaña;Ayoub Otmani;Ludovic Perret;Ludovic Perret

  • Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes

    Magali Bardet;Julia Chaulet;Vlad Dragoi;Ayoub Otmani

  • Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes

    Thomas Debris-Alazard;Nicolas Sendrier;Jean-Pierre Tillich

  • A Distinguisher for High Rate McEliece Cryptosystems.

    Jean-Charles Faugère;Valérie Gauthier;Ayoub Otmani;Ludovic Perret

  • Hashing with SL_2

    Jean-Pierre Tillich;Gilles Zémor

  • Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes

    Alain Couvreur;Philippe Gaborit;Valérie Gautier;Ayoub Otmani

Frequent Co-Authors

Philippe Gaborit
Philippe Gaborit University of Limoges
Gilles Zémor
Gilles Zémor University of Bordeaux
Shay Gueron
Shay Gueron University of Haifa
Jean-Charles Faugère
Jean-Charles Faugère French Institute for Research in Computer Science and Automation - INRIA
Tim Güneysu
Tim Güneysu Ruhr University Bochum
Anthony Leverrier
Anthony Leverrier French Institute for Research in Computer Science and Automation - INRIA
Anne Canteaut
Anne Canteaut French Institute for Research in Computer Science and Automation - INRIA
Jean-Jacques Quisquater
Jean-Jacques Quisquater Université Catholique de Louvain
Claude Carlet
Claude Carlet Paris 8 University
Emmanuel Prouff
Emmanuel Prouff Apple (France)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online learning options for Computer Science in the USA can open up diverse career pathways and make degree attainment accessible to more students. Many prospective learners are drawn to the cheapest online colleges, which provide a quality education at a fraction of the traditional cost.

Not all students start their journey with top academic scores. If your GPA is lower than you’d like, there are several online schools that accept low gpa applicants, helping more students access degree programs and improve their career prospects.

A computer science degree is highly versatile, but so are degrees that combine technology with other fields, such as environmental science and teaching. Discovering jobs with elementary education and environmental science degree showcases the broad range of interdisciplinary opportunities available.

For motivated students eager to enter the tech workforce quickly, there are several highly respected online computer science degree programs available in accelerated formats, allowing for rapid completion without sacrificing quality.

Best Scientists Citing Jean-Pierre Tillich

Trending Scientists

Recently Published Articles