scientific article; zbMATH DE number 562223

MaRDI QIDQ4290420zbMATH OpenFDO

Authors Yong-Hong Long

Publication date 16 June 1994

zbMATH Keywords

\(L^ 3\) algorithmfactorizationprimitive integer polynomialsecurity of RSA public key cryptosystem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Coding and Cryptography
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Advances in Cryptology – CRYPTO 2004
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• A public-key cryptosystem utilizing cyclotomic fields

Cited in

(6)

• Factorizing RSA keys, an improved analogue solution
• A cubic RSA code equivalent to factorization
• Introducing \(S\)-index into factoring RSA modulus via Lucas sequences
• Advances in Cryptology – CRYPTO 2004
• Coding and Cryptography
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring

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 Q4290420)