On the analysis of cryptographic assumptions in the generic ring model

DOI10.1007/S00145-012-9120-YzbMATH Open1279.94089OpenAlexW2162807851MaRDI QIDQ2377063FDOQ2377063

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

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

zbMATH Keywords

Jacobi symbolgeneric ring modelidealized models of computationquadratic residuosity assumptionsubset membership problems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

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

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)