World's Best Scientists 2026 revealed!
Philippe Gaborit

Philippe Gaborit

D-Index & Metrics

Computer Science

D-Index
46
Citations
6204
World Ranking
6951
National Ranking
152

Overview

Philippe Gaborit is affiliated with the University of Limoges in France. Their research spans multiple areas primarily within computer science and engineering. The main fields of study include computer science, with 116 publications, and engineering, with 25 publications. Their work covers several subfields such as artificial intelligence, electrical and electronic engineering, computational theory and mathematics, computer vision and pattern recognition, and information systems.

Their research focuses heavily on topics related to coding theory and cryptography, which accounts for a significant portion of their work. Other notable topics include cryptography and data security, graph theory and CDMA systems, cryptographic implementations and security, cryptography and residue arithmetic, chaos-based image and signal encryption, and polynomial and algebraic computation.

Frequent collaborators include Loïc Bidoux, Nicolas Aragon, Victor Dyseryn, Maxime Bros, and Gilles Zémor. These co-authors have worked closely with Gaborit, contributing to various publications over time.

Philippe Gaborit has published extensively in various academic venues. The most frequent publication venues are:

  • arXiv (Cornell University)
  • Designs Codes and Cryptography
  • IEEE Transactions on Information Theory
  • Advances in Mathematics of Communications
  • Signal Processing

Some of the recent papers include:

  • Efficient image tampering localization using semi-fragile watermarking and error control codes, 2021, Signal Processing
  • Code-based signatures from new proofs of knowledge for the syndrome decoding problem, 2022, Designs Codes and Cryptography
  • Revisiting algebraic attacks on MinRank and on the rank decoding problem, 2023, Designs Codes and Cryptography
  • Cryptanalysis of a code-based one-time signature, 2020, Designs Codes and Cryptography
  • A practicable timing attack against HQC and its countermeasure, 2020, Advances in Mathematics of Communications

Best Publications

  • Type II codes over F/sub 2/+uF/sub 2/

    S.T. Dougherty;P. Gaborit;M. Harada;P. Sole

  • Reducing Key Length of the McEliece Cryptosystem

    Thierry P. Berger;Pierre-Louis Cayrel;Philippe Gaborit;Ayoub Otmani

  • Efficient computation of algebraic immunity for algebraic and fast algebraic attacks

    Frederik Armknecht;Claude Carlet;Philippe Gaborit;Simon Künzli

  • Shorter keys for code-based cryptography

    Philippe Gaborit

  • Construction of bent functions via Niho power functions

    Hans Dobbertin;Gregor Leander;Anne Canteaut;Claude Carlet

  • Linear constructions for DNA codes

    Philippe Gaborit;Oliver D. King

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

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

  • A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

    Carlos Aguilar Melchor;P Cayrel;P Gaborit;F Laguillaumie

  • On the Complexity of the Rank Syndrome Decoding Problem

    Philippe Gaborit;Olivier Ruatta;Julien Schrek

  • Additively homomorphic encryption with d-operand multiplications

    Carlos Aguilar Melchor;Philippe Gaborit;Javier Herranz

  • A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol.

    Carlos Aguilar Melchor;Philippe Gaborit

  • Low Rank Parity Check codes and their application to cryptography

    Philippe Gaborit;Gaétan Murat;Olivier Ruatta;Gilles Zemor

  • On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes

    Philippe Gaborit;Gilles Zemor

  • Efficient Encryption From Random Quasi-Cyclic Codes

    Carlos Aguilar-Melchor;Olivier Blazy;Jean-Christophe Deneuville;Philippe Gaborit

  • Lightweight code-based identification and signature

    P. Gaborit;M. Girault

  • BIKE: Bit Flipping Key Encapsulation

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

  • Type II Codes over

    Philippe Gaborit;Vera Pless;Patrick SoleH

  • Type IV self-dual codes over rings

    S.T. Dougherty;P. Gaborit;M. Harada;A. Munemasa

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

    Magali Bardet;Maxime Bros;Daniel Cabarcas;Philippe Gaborit

  • A fast private information retrieval protocol

    C.A. Melchor;P. Gaborit

  • A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

    Carlos Aguilar Melchor;Pierre-Louis Cayrel;Philippe Gaborit

  • Hamming Quasi-Cyclic (HQC)

    Carlos Aguilar Melchor;Nicolas Aragon;Slim Bettaieb;Loïc Bidoux

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

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

Frequent Co-Authors

Gilles Zémor
Gilles Zémor University of Bordeaux
Jean-Pierre Tillich
Jean-Pierre Tillich French Institute for Research in Computer Science and Automation - INRIA
Vera Pless
Vera Pless University of Illinois at Chicago
Patrick Solé
Patrick Solé Centre national de la recherche scientifique, CNRS
Claude Carlet
Claude Carlet Paris 8 University
Xavier Boyen
Xavier Boyen Queensland University of Technology
Willi Meier
Willi Meier University of Applied Sciences and Arts Northwestern Switzerland
Oliver D. King
Oliver D. King University of Massachusetts Chan Medical School
Emmanuel Prouff
Emmanuel Prouff Apple (France)
Anne Canteaut
Anne Canteaut French Institute for Research in Computer Science and Automation - INRIA

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 degree options can open various career pathways for prospective Computer Science students in the USA. Many choose an associate degree online to quickly gain foundational skills and enter the tech job market sooner. These programs can often be completed in less than two years, making them ideal for those balancing study with work or family commitments.

For those interested in leadership, the shortest online edd programs offer a fast-track route to educational roles, equipping graduates with advanced administrative and research skills. Similarly, professionals looking to achieve the highest academic qualifications without breaking the bank may consider cheap online PhD options, which make doctoral-level education more accessible.

Additionally, a background in business and management complements technical expertise. The cheapest online business management degree can help aspiring tech leaders understand organizational strategy and operational efficiency, enhancing their employability in both tech startups and established companies.

Whether seeking a quick entry into the workforce, aiming for advanced leadership, or combining technical skills with business acumen, these online programs offer flexible and affordable pathways to build a rewarding career in technology.

Best Scientists Citing Philippe Gaborit

Trending Scientists

Recently Published Articles