Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme (Q5738871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in L_|_ K|(12) and application to the cryptanalysis of a FHE scheme |
scientific article; zbMATH DE number 6729661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme |
scientific article; zbMATH DE number 6729661 |
Statements
Computing Generator in Cyclotomic Integer Rings (English)
0 references
13 June 2017
0 references
0 references
0 references
0 references
0.8784035444259644
0 references
0.8103920221328735
0 references
0.8079573512077332
0 references
0.7485246062278748
0 references
0.7397887110710144
0 references
