An improved binary algorithm for RSA

DOI10.1016/0898-1221(93)90295-7MaRDI QIDQ2365963zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 June 1993

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(93)90295-7

zbMATH Keywords

binary algorithmbinary redundant representationsRSA cryptographic system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 1583791
• Improved results on cryptanalysis of prime power RSA
• scientific article; zbMATH DE number 1759272
• An improvement of a cryptanalysis algorithm
• Stronger security proofs for RSA and Rabin bits.
• Factorizing RSA keys, an improved analogue solution
• An improved analysis on three variants of the RSA cryptosystem
• A modification of the RSA public-key encryption procedure (Corresp.)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• RSA Chips (Past/Present/Future) (Extended abstract)

Cited in

(10)

• Redundant integer representations and fast exponentiation
• Stronger security proofs for RSA and Rabin bits.
• scientific article; zbMATH DE number 1583791 (Why is no real title available?)
• A note on an algorithm in cryptography
• A modification of the RSA public-key encryption procedure (Corresp.)
• scientific article; zbMATH DE number 503247 (Why is no real title available?)
• Minimal weight k-SR representations
• Improved Rabin's scheme with high efficiency
• scientific article; zbMATH DE number 2219412 (Why is no real title available?)
• RM- RSA algorithm

This page was built for publication: An improved binary algorithm for RSA

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