57 search results - page 1 / 12 » Complexity of Ring Morphism Problems |
CC
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
PKC
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still,...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
