# Fast Generation of RSA Keys using Smooth Integers

@article{Dimitrov2021FastGO, title={Fast Generation of RSA Keys using Smooth Integers}, author={Vassil S. Dimitrov and Luigi Vigneri and Vidal Attias}, journal={IEEE Transactions on Computers}, year={2021} }

Primality generation is the cornerstone of several essential cryptographic systems. The problem has been a subject of deep investigations, but there is still a substantial room for improvements. Typically, the algorithms used have two parts – trial divisions aimed at eliminating numbers with small prime factors and primality tests based on an easy-to-compute statement that is valid for primes and invalid for composites. In this paper, we will showcase a technique that will eliminate the first…

## References

SHOWING 1-10 OF 37 REFERENCES

The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli

- Computer ScienceCCS
- 2017

A practical factorization method for various key lengths including 1024 and 2048 bits is proposed, which requires no additional information except for the value of the public modulus and does not depend on a weak or a faulty random number generator.

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

- Computer Science, MathematicsCCS
- 2017

A simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification circuit size, which is attractive not only for very large verification circuits but also for moderately large circuits that arise in applications.

Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities

- Mathematics, Computer ScienceJournal of Cryptology
- 1997

It is shown how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a Poole's inequality in two variables over the integers.

Efficient generation of shared RSA keys

- Computer Science, MathematicsJACM
- 2001

Efficient techniques for a number of parties to jointly generate an RSA key are described and each party holds a share of the private exponent that enables threshold decryption.

Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication

- Computer ScienceINDOCRYPT
- 2007

Optimize precomputations and triplings save time for single-scalar multiplication in Jacobian coordinates, Hessian curves, and tripling-oriented Doche/Icart/Kohel curves; there is no evidence that double-base chains are worthwhile for the fastest curves.

The ternary Goldbach conjecture is true

- Mathematics
- 2013

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture.
Both the ternary…

The double-base number system and its application to elliptic curve cryptography

- Mathematics, Computer ScienceMath. Comput.
- 2008

An algorithm for point multiplication on generic elliptic curves, based on a representation of the scalar as a sum of mixed powers of 2 and 3, is described, which leads to efficient point multiplication algorithms for curves defined over both prime and binary fields.

On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computations

- Computer Science2013 IEEE 21st Symposium on Computer Arithmetic
- 2013

A multi-base recoding method for ECC scalar multiplication based on a greedy algorithm starting least significant terms first, which can be fully implemented in hardware without pre-computations and very good performances compared to state-of-art results are reported.

A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers

- MathematicsEUROCRYPT
- 1988

In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values of the integral parameter m, a method for finding large probable primes is proposed.