scientific article; zbMATH DE number 1258344
From MaRDI portal
Publication:4229172
Recommendations
Cited in
(88)- The better bound of private key in RSA with unbalanced primes
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Recent advances in RSA cryptography
- Large decryption exponents in RSA
- The multi-dimension RSA and its low exponent security
- A generalized attack on RSA type cryptosystems
- RSA: a number of formulas to improve the search for p+q
- A generalized attack on some variants of the RSA cryptosystem
- On the security of RSA with primes sharing least-significant bits
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- A hybrid cryptosystem for digital contents confidentiality based on rotation of quantum spin states
- Classical attacks on a variant of the RSA cryptosystem
- Cryptanalysis of RSA variants with primes sharing most significant bits
- Fast rebalanced RSA signature scheme with typical prime generation
- Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images
- The improved QV signature scheme based on conic curves over \(\mathbb Z_n\)
- A new construction of threshold cryptosystems based on RSA
- Generalized cryptanalysis of small CRT-exponent RSA
- Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
- A variant of Wiener's attack on RSA
- Using the TI-92 plus to introduce the RSA cryptosystem
- Factorization using binary decision diagrams
- Simple and efficient batch verification techniques for verifiable delay functions
- Breaking RSA may be as difficult as factoring
- scientific article; zbMATH DE number 1612533 (Why is no real title available?)
- Attacks on Shamir's `RSA for paranoids'
- Factoring RSA moduli with weak prime factors
- NSA and dual EC\_DRBG: Déjà vu all over again?
- Compositeness test with nodal curves
- Constructing permutation rational functions from isogenies
- RSA cryptosystem with fuzzy set theory for encryption and decryption
- Revisiting Wiener’s Attack – New Weak Keys in RSA
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Crypto Engineering: Some History and Some Case Studies
- Small secret exponent attack on RSA variant with modulus N=p^rq
- scientific article; zbMATH DE number 65248 (Why is no real title available?)
- Attacks on the HKM / HFX cryptosystem
- scientific article; zbMATH DE number 2112333 (Why is no real title available?)
- It is easy to determine whether a given integer is prime
- RSA: from the 1970s to the present day
- Quantum random numbers generated by a cloud superconducting quantum computer
- Forty years of attacks on the RSA cryptosystem: a brief survey
- RSA, DH and DSA in the wild
- scientific article; zbMATH DE number 7528065 (Why is no real title available?)
- Using LLL-reduction for solving RSA and factorization problems
- r-prime numbers of degree k
- A new public key scheme based on DRSA and generalized GDLP
- RSA cryptosystem in year 1873?
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Progress in Cryptology – Mycrypt 2005
- A New Class of Weak Encryption Exponents in RSA
- Cryptanalysis of a quadratic knapsack cryptosystem
- Functional encryption: deterministic to randomized functions from simple assumptions
- A variant of RSA using continued fractions
- On the use of RSA as a secret key cryptosystem
- Improvements in the analysis of Kannan's CVP algorithm
- A new attack on some RSA variants
- Long-term security and universal composability
- A generalized attack on the multi-prime power RSA
- Continued fractions applied to a family of RSA-like cryptosystems
- Cryptanalysis of the multi-power RSA cryptosystem variant
- Representing the integer factorization problem using ordered binary decision diagrams
- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- Partial prime factor exposure attacks on some RSA variants
- Implicit-key attack on the RSA cryptosystem
- Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- A security analysis of two classes of RSA-like cryptosystems
- Wiener attack and weak keys of the RSA cryptosystem
- Breaking RSA generically is equivalent to factoring, with preprocessing
- A new generalized lattice attack against a family of RSA-like cryptosystems
- Further cryptanalysis of some variants of the RSA cryptosystem
- A new public key encryption scheme based on the cubic Pell curve using encoding functions
- A new public key cryptosystem based on the cubic Pell curve
- On the number of sparse RSA exponents
- Decrypting nonlinearity: Koopman interpretation and analysis of cryptosystems
- Cryptanalysis of a new variant of the RSA cryptosystem
- SAT and lattice reduction for integer factorization
- A new generalization of the KMOV cryptosystem
- On integer sequences in cryptography
- A generalized partial exposure lattice attack against an RSA variant based on cubic Pell curves
- Distribution of powers modulo p and security of RSA
- SoK: a generalized attack on RSA and its variants
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Cryptanalysis of RSA with two decryption exponents
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 Q4229172)
