scientific article; zbMATH DE number 617153

MaRDI QIDQ4301705zbMATH OpenFDO

Authors

Publication date 14 August 1994

Full work available at URL https://eudml.org/doc/238500

zbMATH Keywords

cryptosystemsfactorizationgeneral surveyLenstra's elliptic curve methodPollard's \(p-1\) method

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4037758
• Prime factorization using square root approximation
• scientific article; zbMATH DE number 4087589
• Divisibility, smoothness and cryptographic applications
• scientific article; zbMATH DE number 1273637

Cited in

(5)

• Handling problems in cryptography with matrix factorization
• scientific article; zbMATH DE number 4037758 (Why is no real title available?)
• Methods for Reducing Approximate-Factorization Errors in Two- and Three-Factored Schemes
• Prime factorization of sums and differences of two like powers
• Prime factorization using square root approximation

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