ABSTRACT
The key generation algorithms for Dual RSA that we show here have been previously published in [236].
The key generation algorithm for Dual RSA with small public exponent, given in Algorithm C.1, takes (n, ne) as input, with ne < n/2, and outputs a valid instance of Dual RSA with two n-bit moduli, an ne-bit public exponent, and with high probability a full sized private exponent (i.e., nd ≈ n). The key generation algorithm for Dual RSA with a small private exponent is exactly the same as for a small public exponent, except that the exponents are exchanged in the output.
