Factoring RSA modulus using prime reconstruction from random known bits (Q3558305)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5703485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factoring RSA modulus using prime reconstruction from random known bits |
scientific article; zbMATH DE number 5703485 |
Statements
Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits (English)
0 references
4 May 2010
0 references
factorization
0 references
prime reconstruction
0 references
random known bits
0 references
RSA
0 references
0.8073981404304504
0 references
0.8059825301170349
0 references
0.7946658134460449
0 references
0.7887833714485168
0 references
0.7778840065002441
0 references
