On the analysis of cryptographic assumptions in the generic ring model

DOI10.1007/S00145-012-9120-YMaRDI QIDQ2377063zbMATH OpenOpenAlexFDO

Authors Tibor Jager, Jörg Schwenk

Publication date 27 June 2013

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-012-9120-y

zbMATH Keywords

Jacobi symbolgeneric ring modelidealized models of computationquadratic residuosity assumptionsubset membership problems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the analysis of cryptographic assumptions in the generic ring model
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• Black-box models of computation in cryptology.
• Breaking RSA Generically Is Equivalent to Factoring
• On the Equivalence of Generic Group Models

Cites work

• scientific article; zbMATH DE number 1583798 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1303114 (Why is no real title available?)
• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Algorithms for black-box fields and their application to cryptography
• Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
• Breaking RSA Generically Is Equivalent to Factoring
• Breaking RSA may not be equivalent to factoring
• Complexity of a determinate algorithm for the discrete logarithm
• Cryptography and Coding
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• New directions in cryptography
• On Black-Box Ring Extraction and Integer Factorization
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• On the analysis of cryptographic assumptions in the generic ring model
• Probabilistic encryption
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• The random oracle methodology, revisited.

Cited in

(5)

• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• Generic hardness of inversion on ring and its relation to self-bilinear map
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• A security analysis of uniformly-layered Rainbow defined over non-commutative rings
• On the analysis of cryptographic assumptions in the generic ring model

This page was built for publication: On the analysis of cryptographic assumptions in the generic ring model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377063)