Cryptographic Complexity

Cryptographic Complexity is a branch of computational complexity theory that studies the inherent difficulty of computational problems underlying cryptographic primitives, distinguished by its focus on average-case hardness, provable security reductions, and the existence of one-way functions essential for secure cryptography.

2.7K

Publications

166.3K

Citations

4.2K

Authors

1.3K

Institutions

Publications per year

2017–2026

646

Authors

4.2K

  1. YI
    Yuval Ishai

    Technion – Israel Institute of Technology, Israel

    35 publications · 3.1K citations

    27

    h-index

  2. EK
    Eyal Kushilevitz

    Technion – Israel Institute of Technology, Israel

    32 publications · 2.6K citations

    25

    h-index

  3. RP
    Rafael Pass

    Cornell University, United States

    32 publications · 2K citations

    22

    h-index

  4. VV
    Vinod Vaikuntanathan

    Massachusetts Institute of Technology, United States

    25 publications · 4.3K citations

    22

    h-index

  5. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    25 publications · 6.4K citations

    21

    h-index

1–5 of 4.2K

Venues

  1. Journal of Cryptology

    114 publications · 10.7K citations

    51

    h-index

  2. IEEE Transactions on Information Theory

    108 publications · 8.9K citations

    46

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 261 publications · 8.3K citations

    43

    h-index

  4. SIAM Journal on Computing

    59 publications · 8.7K citations

    33

    h-index

  5. Designs Codes and Cryptography

    62 publications · 1.8K citations

    25

    h-index

1–5