On the analysis of cryptographic assumptions in the generic ring model

DOI10.1007/s00145-012-9120-yzbMath1279.94089OpenAlexW2162807851MaRDI QIDQ2377063

Tibor Jager, Jorg 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)

Related Items

Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Complexity of a determinate algorithm for the discrete logarithm
• Short signatures without random oracles and the SDH assumption in bilinear groups
• The random oracle methodology, revisited
• Algorithms for Black-Box Fields and their Application to Cryptography
• Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
• On Black-Box Ring Extraction and Integer Factorization
• 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
• On the Analysis of Cryptographic Assumptions in the Generic Ring Model
• New directions in cryptography
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA may not be equivalent to factoring
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• Cryptography and Coding
• Breaking RSA Generically Is Equivalent to Factoring