Quasi-dyadic Codes

Quasi-Dyadic Codes is a class of linear codes characterized by a quasi-dyadic structure in their generator matrices, distinguishing them through efficient algebraic properties that enable compact key representation and enhanced computational efficiency in code-based cryptographic systems.

10

Publications

256

Citations

27

Authors

34

Institutions

Publications per year

2017–2026

2

Authors

27

  1. JT
    Jean–Pierre Tillich

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 70 citations

    3

    h-index

  2. AO
    Ayoub Otmani

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 70 citations

    3

    h-index

  3. PS
    Paulo S. L. M. Barreto

    Universidade de São Paulo, Brazil

    3 publications · 70 citations

    3

    h-index

  4. LP
    Ludovic Perret

    Sorbonne Université, France

    3 publications · 70 citations

    3

    h-index

  5. JF
    Jean‐Charles Faugère

    Sorbonne Université, France

    3 publications · 70 citations

    3

    h-index

1–5 of 27

Venues

  1. Journal of Mathematical Cryptology

    JMC · 2 publications · 81 citations

    2

    h-index

  2. IEEE Transactions on Information Theory

    2 publications · 50 citations

    2

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 21 citations

    1

    h-index

  4. ACM Journal on Emerging Technologies in Computing Systems

    JETC · 1 publications · 26 citations

    1

    h-index

  5. Lecture notes in computer science

    LNCS · Book series · 1 publications · 20 citations

    1

    h-index

1–5