FACTORING VIA SUPERENCYRPTION

DOI10.1080/0161-118291857028MaRDI QIDQ4739797zbMATH OpenOpenAlexFDO

Authors Shimshon Berkovits

Publication date 1982

Published in Cryptologia (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0161-118291857028

zbMATH Keywords

cycling algorithmcycling attackfactoringfactoring algorithmsafe primessuperencryption

Mathematics Subject Classification ID

Factorization; primality (11A51) Factorization (11Y05) Cryptography (94A60)

Recommendations

• New Attacks on the RSA Cryptosystem
• Some Public-Key Crypto-Functions as Intractable as Factorization
• scientific article; zbMATH DE number 1759342
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• SECURING THE RSA-CRYPTOSYSTEM AGAINST CYCLING ATTACKS

Cited in

(2)

• scientific article; zbMATH DE number 4081459 (Why is no real title available?)
• A note on low order assumptions in RSA groups

This page was built for publication: FACTORING VIA SUPERENCYRPTION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739797)