Fast RSA-type cryptosystems using n-adic expansion

DOI10.1007/BFB0052249MaRDI QIDQ4364564zbMATH OpenFDO

Authors Tsuyoshi Takagi

Publication date 6 July 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0052249

zbMATH Keywords

fast multi-block RSApublic key cryptosystemsRSA-type cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fast RSA-type cryptosystem modulo p^k q
• A fast and secure RSA public key cryptosystem
• scientific article; zbMATH DE number 1676654

Cited in

(6)

• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
• Fast RSA-type cryptosystem modulo p^k q
• scientific article; zbMATH DE number 1950337 (Why is no real title available?)
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point

This page was built for publication: Fast RSA-type cryptosystems using \(n\)-adic expansion

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