scientific article; zbMATH DE number 1302856
From MaRDI portal
Publication:4249341
zbMath0931.94041MaRDI QIDQ4249341
Publication date: 8 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Improvements to RSA key generation and CRT on embedded devices ⋮ Factoring multi-power RSA moduli with primes sharing least or most significant bits ⋮ Cryptanalysis of Prime Power RSA with two private exponents ⋮ Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ A generalized attack on RSA type cryptosystems ⋮ Comment on ``An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC) ⋮ New Attacks on RSA with Moduli N = p r q ⋮ A New Partial Key Exposure Attack on Multi-power RSA ⋮ Small secret exponent attack on RSA variant with modulus \(N=p^rq\) ⋮ A new attack on some RSA variants ⋮ A generalized attack on the multi-prime power RSA ⋮ An Adaptation of the NICE Cryptosystem to Real Quadratic Orders ⋮ Cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Improved cryptanalysis of the multi-power RSA cryptosystem variant ⋮ Factoring multi power RSA moduli with a class of secret exponents ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits ⋮ A generalized attack on some variants of the RSA cryptosystem ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption ⋮ Cryptanalysis of Dual RSA ⋮ A method for obtaining digital signatures and public-key cryptosystems ⋮ New number-theoretic cryptographic primitives ⋮ A new generalization of the KMOV cryptosystem ⋮ RSA Moduli with a Predetermined Portion: Techniques and Applications ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Iterative root approximation in \(p\)-adic numerical analysis ⋮ Revisiting prime power RSA ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
This page was built for publication:
