scientific article; zbMATH DE number 4139669
From MaRDI portal
Publication:3472042
Recommendations
- SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
- On using primes for public key encryption systems
- Idempotent factorizations in the cryptography classroom
- Cryptanalysis of RSA with private key \(d\) less than \(N^{0. 292}\)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472042)