The Complexity of Black-Box Ring Problems

DOI10.1007/11809678_15MaRDI QIDQ3591294zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Quantum query complexity of multilinear identity testing
• On Black-Box Ring Extraction and Integer Factorization
• Complexity of ring morphism problems
• Black-box models of computation in cryptology.
• Solvable black-box group problems are low for PP

Cited in

(7)

• An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
• On Black-Box Ring Extraction and Integer Factorization
• Homomorphic encryption and some black box attacks
• Mathematical etudes on quantum computation
• Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
• Computing primitive idempotents in finite commutative rings and applications
• Polynomial-time algorithms for black-box distributive expanded groups

This page was built for publication: The Complexity of Black-Box Ring Problems

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