The Complexity of Black-Box Ring Problems

DOI10.1007/11809678_15zbMath1162.68455OpenAlexW1548467694MaRDI QIDQ3591294

Partha Mukhopadhyay, Bireswar Das, V. Arvind

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)

Related Items (5)

Homomorphic Encryption and Some Black Box Attacks ⋮ An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank ⋮ Mathematical etudes on quantum computation ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Computing primitive idempotents in finite commutative rings and applications

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