World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
30
Citations
4611
World Ranking
3474
National Ranking
210

Overview

Pascale Charpin is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research spans multiple areas within computer science and engineering, focusing primarily on topics related to coding theory, cryptography, graph theory, and communication systems.

The main fields of study in which Pascale Charpin has contributed include:

  • Computer Science
  • Engineering

Their work further specializes in the following subfields:

  • Artificial Intelligence
  • Electrical and Electronic Engineering

Key topics covered in Pascale Charpin's research output are:

  • Coding theory and cryptography
  • Graph theory and CDMA systems
  • Cryptographic Implementations and Security

Publication records indicate a focus on reputable venues, with at least one paper published in the journal Finite Fields and Their Applications. The recent paper listed is titled The crooked property, published in 2022 in Finite Fields and Their Applications. This paper reflects an ongoing engagement with theoretical and applied aspects of finite fields in the context of coding and cryptographic research.

There are no frequent co-authors recorded, suggesting an independent research trajectory or diverse collaboration networks not yet consolidated. The publication venue history centers around Finite Fields and Their Applications, indicating a consistent submission to specialized journals within the field.

Best Publications

  • Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

    Claude Carlet;Pascale Charpin;Victor Zinoviev

  • On Correlation-Immune Functions

    Paul Camion;Claude Carlet;Pascale Charpin;Nicolas Sendrier

  • Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture

    A. Canteaut;P. Charpin;H. Dobbertin

  • A new class of monomial bent functions

    Anne Canteaut;Pascale Charpin;Gohar M. Kyureghyan

  • Decomposing bent functions

    A. Canteaut;P. Charpin

  • On Almost Perfect Nonlinear Functions Over $mmb F_2^n$

    T.P. Berger;A. Canteaut;P. Charpin;Y. Laigle-Chapuy

  • On cryptographic properties of the cosets of R(1, m)

    A. Canteaut;C. Carlet;P. Charpin;C. Fontaine

  • Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F 2 m , and Crosscorrelation of Maximum-Length Sequences

    Anne Canteaut;Pascale Charpin;Hans Dobbertin

  • On bent and semi-bent quadratic Boolean functions

    P. Charpin;E. Pasalic;C. Tavernier

  • Propagation characteristics and correlation-immunity of highly nonlinear boolean functions

    Anne Canteaut;Claude Carlet;Pascale Charpin;Caroline Fontaine

  • Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials

    P. Charpin;Guang Gong

  • Differential properties of power functions

    Celine Blondeau;Anne Canteaut;Pascale Charpin

  • Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$

    Pascale Charpin;Gohar M. Kyureghyan

  • Studying the locator polynomials of minimum weight codewords of BCH codes

    D. Augot;P. Charpin;N. Sendrier

  • Open problems on cyclic codes

    Pascale Charpin

  • Cyclic codes with few weights and Niho exponents

    Pascale Charpin

  • When does G(x )+γTr(H(x)) permute Fpn?

    Pascale Charpin;Gohar Kyureghyan

  • A New Characterization of Almost Bent Functions

    Anne Canteaut;Pascale Charpin;Hans Dobbertin

  • The divisibility modulo 24 of Kloosterman sums on GF(2m), m odd

    Pascale Charpin;Tor Helleseth;Victor Zinoviev

  • Finite Fields and Their Applications

    Unknown

  • Hyperbent functions, Kloosterman sums and Dickson polynomials

    P. Charpin;Guang Gong

Frequent Co-Authors

Anne Canteaut
Anne Canteaut French Institute for Research in Computer Science and Automation - INRIA
Claude Carlet
Claude Carlet Paris 8 University
Tor Helleseth
Tor Helleseth University of Bergen
Sihem Mesnager
Sihem Mesnager Paris 8 University
Jean-Pierre Tillich
Jean-Pierre Tillich French Institute for Research in Computer Science and Automation - INRIA
Guang Gong
Guang Gong University of Waterloo
Yu Sasaki
Yu Sasaki NTT (Japan)
Thomas Johansson
Thomas Johansson Lund University
Philippe Gaborit
Philippe Gaborit University of Limoges
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

For students pursuing Mathematics in the USA, exploring related online degrees can open diverse career pathways. Many professionals complement their math background with business knowledge by enrolling in year long mba programs. These intensive programs focus on leadership and strategy, allowing graduates to transition smoothly into management roles.

Flexibility is key for working students, and some top programs offer the option of can you transfer credits into an mba program. This can significantly shorten the time to completion and reduce costs, making advanced studies more accessible.

Additionally, data is central to many math-related careers. Pursuing a specialized degree like a analytics masters programs equips students with skills in statistical analysis, machine learning, and big data—highly sought after in technology and finance fields.

For those seeking a more straightforward admission process, exploring the easiest mba program options can provide a viable path without compromising education quality, especially for career changers aiming to add management expertise.

Best Scientists Citing Pascale Charpin

Trending Scientists

Recently Published Articles