H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 55 Citations 11,049 206 World Ranking 2128 National Ranking 34
Mathematics D-index 59 Citations 11,022 216 World Ranking 276 National Ranking 15

Overview

What is he best known for?

The fields of study he is best known for:

  • Algebra
  • Discrete mathematics
  • Cryptography

His primary scientific interests are in Discrete mathematics, Boolean function, Combinatorics, Nonlinear system and Cryptography. His study of Bent function is a part of Discrete mathematics. His Boolean function research is multidisciplinary, incorporating perspectives in Correlation immunity, Upper and lower bounds, Theoretical computer science and Circuit complexity.

His Combinatorics research incorporates elements of Function, Reed–Muller code, Hamming code and Cover. The concepts of his Nonlinear system study are interwoven with issues in Power function, Mathematical analysis, Algebraic number, Algebra and Pure mathematics. His study in Cryptography is interdisciplinary in nature, drawing from both Plaintext and Simple.

His most cited work include:

  • Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes (683 citations)
  • Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems (447 citations)
  • Algebraic Attacks and Decomposition of Boolean Functions (424 citations)

What are the main themes of his work throughout his whole career to date?

Claude Carlet mainly focuses on Discrete mathematics, Boolean function, Combinatorics, Function and Nonlinear system. Claude Carlet interconnects Algebraic function, Real algebraic geometry and Linear code in the investigation of issues within Discrete mathematics. The various areas that he examines in his Boolean function study include Upper and lower bounds, Stream cipher, Cryptography and Algebraic number.

His work in Combinatorics tackles topics such as Class which are related to areas like Pure mathematics. His study looks at the relationship between Function and fields such as Inverse, as well as how they intersect with chemical problems. His studies in Nonlinear system integrate themes in fields like Coding theory and Affine transformation.

He most often published in these fields:

  • Discrete mathematics (52.66%)
  • Boolean function (49.02%)
  • Combinatorics (40.90%)

What were the highlights of his more recent work (between 2017-2021)?

  • Boolean function (49.02%)
  • Combinatorics (40.90%)
  • Discrete mathematics (52.66%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Boolean function, Combinatorics, Discrete mathematics, Function and Cryptography. Bent function is the focus of his Boolean function research. His work carried out in the field of Combinatorics brings together such families of science as Linear code, Hadamard transform, Algebraic number and Power function.

In general Discrete mathematics, his work in Finite field is often linked to Special class and Liquid-crystal display linking many areas of study. His Function research incorporates elements of Characterization, Differential uniformity, Degree and Conjecture. In the field of Cryptography, his study on Side channel attack overlaps with subjects such as Coding.

Between 2017 and 2021, his most popular works were:

  • Linear Codes Over $\mathbb F_q$ Are Equivalent to LCD Codes for $q>3$ (80 citations)
  • Euclidean and Hermitian LCD MDS codes (60 citations)
  • New Characterization and Parametrization of LCD Codes (35 citations)

In his most recent research, the most cited papers focused on:

  • Algebra
  • Cryptography
  • Mathematical analysis

His main research concerns Discrete mathematics, Cryptography, Combinatorics, Boolean function and Function. The concepts of his Discrete mathematics study are interwoven with issues in Binary number and Code. His research investigates the link between Cryptography and topics such as Coding theory that cross with problems in Fault injection and Block cipher.

In his research on the topic of Combinatorics, Monomial and Equivalence is strongly related with Nonlinear system. Particularly relevant to Bent function is his body of work in Boolean function. His Function study incorporates themes from Characterization and Hadamard transform.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes

Claude Carlet.
Boolean Models and Methods (2010)

1063 Citations

Algebraic Attacks and Decomposition of Boolean Functions

Willi Meier;Enes Pasalic;Claude Carlet.
theory and application of cryptographic techniques (2004)

677 Citations

Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems

Claude Carlet;Pascale Charpin;Victor Zinoviev.
Designs, Codes and Cryptography (1998)

612 Citations

Vectorial Boolean Functions for Cryptography

Claude Carlet.
Boolean Models and Methods (2010)

499 Citations

On Correlation-Immune Functions

Paul Camion;Claude Carlet;Pascale Charpin;Nicolas Sendrier.
international cryptology conference (1991)

334 Citations

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction

C. Carlet;D.K. Dalai;K.C. Gupta;S. Maitra.
IEEE Transactions on Information Theory (2006)

328 Citations

An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity

Claude Carlet;Keqin Feng.
international conference on the theory and application of cryptology and information security (2008)

273 Citations

Highly nonlinear mappings

Claude Carlet;Cunsheng Ding.
Journal of Complexity (2004)

253 Citations

Partially-bent functions

Claude Carlet.
Designs, Codes and Cryptography (1993)

239 Citations

Linear codes from perfect nonlinear mappings and their secret sharing schemes

C. Carlet;Cunsheng Ding;Jin Yuan.
IEEE Transactions on Information Theory (2005)

238 Citations

Editorial Boards

Cryptography and Communications
(Impact Factor: 1.376)

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

Contact us

Best Scientists Citing Claude Carlet

Cunsheng Ding

Cunsheng Ding

Hong Kong University of Science and Technology

Publications: 82

Tor Helleseth

Tor Helleseth

University of Bergen

Publications: 51

Subhamoy Maitra

Subhamoy Maitra

Indian Statistical Institute

Publications: 48

Guang Gong

Guang Gong

University of Waterloo

Publications: 39

Gregor Leander

Gregor Leander

Ruhr University Bochum

Publications: 31

Patrick Solé

Patrick Solé

Télécom ParisTech

Publications: 30

Sylvain Guilley

Sylvain Guilley

Télécom ParisTech

Publications: 27

François-Xavier Standaert

François-Xavier Standaert

Université Catholique de Louvain

Publications: 24

Xiaohu Tang

Xiaohu Tang

Southwest Jiaotong University

Publications: 20

Yuliang Zheng

Yuliang Zheng

University of Alabama at Birmingham

Publications: 17

Bart Preneel

Bart Preneel

KU Leuven

Publications: 17

Debdeep Mukhopadhyay

Debdeep Mukhopadhyay

Indian Institute of Technology Kharagpur

Publications: 15

Kaisa Nyberg

Kaisa Nyberg

Aalto University

Publications: 15

Emmanuel Prouff

Emmanuel Prouff

Université Paris Cité

Publications: 14

Palash Sarkar

Palash Sarkar

Indian Statistical Institute

Publications: 14

Thomas Johansson

Thomas Johansson

Lund University

Publications: 12

Something went wrong. Please try again later.