scientific article; zbMATH DE number 57438

MaRDI QIDQ4004448zbMATH OpenFDO

Authors Yong-Hong Long

Publication date 27 September 1992

zbMATH Keywords

cryptanalysisdiophantine equationpublic key cryptographyRSA cryptoalgorithmsecurity protection

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Successful cryptanalytic attacks upon RSA moduli N=pq
• New Attacks on the RSA Cryptosystem
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem

Cited in

(11)

• Fixed points of the RSA encryption algorithm
• RSA: a number of formulas to improve the search for p+q
• On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\)
• Decoding RSA public-key cryptosystem by algorithmic self-assembly
• Public Key Perturbation of Randomized RSA Implementations
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• M mod 3 security of RSA
• Random Forest profiling attack on advanced encryption standard
• An effective algorithm to private-key in the RSA cryptosystem
• Perturbating RSA Public Keys: An Improved Attack
• New probabilistic public-key encryption based on the RSA cryptosystem

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