A more complete cryptanalysis of the RSA-polynomial problem (Q6841371)
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 8174808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A more complete cryptanalysis of the RSA-polynomial problem |
scientific article; zbMATH DE number 8174808 |
Statements
A more complete cryptanalysis of the RSA-polynomial problem (English)
0 references
20 March 2026
0 references
cryptographic hard problem
0 references
lattice-based techniques
0 references
RSA-polynomial
0 references
semiprime factorization
0 references
unbalanced primes
0 references
0 references
0 references
0 references
0 references
0 references
