On the analysis of cryptographic assumptions in the generic ring model

DOI10.1007/978-3-642-10366-7_24MaRDI QIDQ3650705zbMATH OpenOpenAlexFDO

Authors Tibor Jager, Jörg Schwenk

Publication date 15 December 2009

Published in Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10366-7_24

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

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

Cited in

(8)

• Computing primitive idempotents in finite commutative rings and applications
• A security analysis of uniformly-layered Rainbow defined over non-commutative rings
• Generic hardness of inversion on ring and its relation to self-bilinear map
• Identity-based encryption in DDH hard groups
• Breaking RSA Generically Is Equivalent to Factoring
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• New ideas to build noise-free homomorphic cryptosystems
• 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 Q3650705)