The following pages link to (Q4229172):
Displaying 50 items.
- Breaking RSA may be as difficult as factoring (Q271594) (← links)
- NSA and dual EC\(\_\)DRBG: Déjà vu all over again? (Q297495) (← links)
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\) (Q398942) (← links)
- Cryptanalysis of a quadratic knapsack cryptosystem (Q552295) (← links)
- Long-term security and universal composability (Q604632) (← links)
- On the number of sparse RSA exponents (Q701120) (← links)
- A new generalization of the KMOV cryptosystem (Q721553) (← links)
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA (Q834923) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- Cryptanalysis of RSA with two decryption exponents (Q991745) (← links)
- The better bound of private key in RSA with unbalanced primes (Q1406195) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Large decryption exponents in RSA (Q1431928) (← links)
- The multi-dimension RSA and its low exponent security (Q1589779) (← links)
- A generalized attack on RSA type cryptosystems (Q1680536) (← links)
- RSA: a number of formulas to improve the search for \(p+q\) (Q1684046) (← links)
- A generalized attack on some variants of the RSA cryptosystem (Q1726690) (← links)
- On the security of RSA with primes sharing least-significant bits (Q1762562) (← links)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures (Q2040024) (← links)
- A hybrid cryptosystem for digital contents confidentiality based on rotation of quantum spin states (Q2139294) (← links)
- Classical attacks on a variant of the RSA cryptosystem (Q2146087) (← links)
- Cryptanalysis of RSA variants with primes sharing most significant bits (Q2154038) (← links)
- Fast rebalanced RSA signature scheme with typical prime generation (Q2182709) (← links)
- Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images (Q2239534) (← links)
- The improved QV signature scheme based on conic curves over \(\mathbb Z_n\) (Q2267090) (← links)
- A new construction of threshold cryptosystems based on RSA (Q2279723) (← links)
- Generalized cryptanalysis of small CRT-exponent RSA (Q2330126) (← links)
- Security pitfalls of an efficient threshold proxy signature scheme for mobile agents (Q2350583) (← links)
- A variant of Wiener's attack on RSA (Q2390948) (← links)
- Factorization using binary decision diagrams (Q2632840) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Factoring RSA Moduli with Weak Prime Factors (Q2947096) (← links)
- Compositeness test with nodal curves (Q3174870) (← links)
- Constructing Permutation Rational Functions from Isogenies (Q3176494) (← links)
- RSA cryptosystem with fuzzy set theory for encryption and decryption (Q3382147) (← links)
- Revisiting Wiener’s Attack – New Weak Keys in RSA (Q3540147) (← links)
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors (Q3617506) (← links)
- It is easy to determine whether a given integer is prime (Q4829920) (← links)
- Quantum Random Numbers Generated by a Cloud Superconducting Quantum Computer (Q4964353) (← links)
- Forty years of attacks on the RSA cryptosystem: A brief survey (Q5030492) (← links)
- (Q5076805) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- (Q5214717) (← links)
- A new public key scheme based on DRSA and generalized GDLP (Q5298340) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- RSA Moduli with a Predetermined Portion: Techniques and Applications (Q5458502) (← links)
- A New Class of Weak Encryption Exponents in RSA (Q5504634) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- A variant of RSA using continued fractions (Q5865665) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
