Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331)
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: Algorithms for CRT-variant of approximate greatest common divisor problem |
scientific article; zbMATH DE number 7347750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for CRT-variant of approximate greatest common divisor problem |
scientific article; zbMATH DE number 7347750 |
Statements
Algorithms for CRT-variant of approximate greatest common divisor problem (English)
0 references
12 May 2021
0 references
CCK-ACD
0 references
lattice
0 references
orthogonal lattice attack
0 references
SDA
0 references
0 references
0 references
0.8380187153816223
0 references
0.7551653385162354
0 references
0.7499479651451111
0 references
0.7441273927688599
0 references
0.7357494831085205
0 references
