Computing primitive idempotents in finite commutative rings and applications

被引:0
|
作者
Barcau, Mugurel [1 ,2 ]
Pasol, Vicentiu [1 ,2 ]
机构
[1] Romanian Acad, Sim Stoilow Inst Math, POB 1-764, Bucharest 014700, Romania
[2] certSIGN Res & Dev, Blvd Tudor Vladimirescu, 29, AFI Tech Pk 1, Bucharest 050881, Romania
关键词
Generic ring model; Black-box rings; Primitive idempotents; Quantum computing; Homomorphic encryption schemes; FULLY HOMOMORPHIC ENCRYPTION; FACTORING POLYNOMIALS; ALGORITHMS; FIELDS;
D O I
10.1016/j.jsc.2023.102294
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we compute an algebraic decomposition of blackbox rings in the generic ring model. More precisely, we explicitly decompose a black-box ring as a direct product of a nilpotent black-box ring and unital local black-box rings, by computing all its primitive idempotents. The algorithm presented in this paper uses quantum subroutines for the computation of the p-power parts of a black-box ring and then classical algorithms for the computation of the corresponding primitive idempotents. As a by-product, we get that the reduction of a black-box ring is also a black-box ring. The first application of this decomposition is an extension of the work of Maurer and Raub (2007) on representation problem in black-box finite fields to the case of reduced p-power blackbox rings. Another important application is an IND-CCA1 attack for any ring homomorphic encryption scheme in the generic ring model. Moreover, when the plaintext space is a finite reduced black-box ring, we present a plaintext-recovery attack based on representation problem in black-box prime fields. In particular, if the ciphertext space has smooth characteristic, the plaintextrecovery attack is effectively computable in the generic ring model. (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:28
相关论文
共 50 条