Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017)
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: Further improvement of factoring N=p^rq^s with partial known bits |
scientific article; zbMATH DE number 7024184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further improvement of factoring \(N=p^rq^s\) with partial known bits |
scientific article; zbMATH DE number 7024184 |
Statements
Further improvement of factoring \(N=p^rq^s\) with partial known bits (English)
0 references
15 February 2019
0 references
RSA variant
0 references
partial known bits
0 references
lattice
0 references
Coppersmith's method
0 references
0.8747905492782593
0 references
0.8589061498641968
0 references
0.8144097328186035
0 references
0.8123785853385925
0 references
0.8073981404304504
0 references
