Black-Box Models of Computation in Cryptology

DOI10.1007/978-3-8348-1990-1zbMath1257.94003OpenAlexW85577164MaRDI QIDQ2897218

Tibor Jager

Publication date: 10 July 2012

Full work available at URL: https://doi.org/10.1007/978-3-8348-1990-1

zbMATH Keywords

RSAcryptographyfactorizationTuring machinediscrete logarithmgeneric modelgeneric reductionDiffie-Hellman problemcomputational hardnesscroptosystems based on algebraic structuresgeneric bilinear groupsemi-generic modelsequrity problems

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Factorization (11Y05)

Related Items (1)

Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs

This page was built for publication: Black-Box Models of Computation in Cryptology