The structure of the RSA public key requires that N be a large semiprime (i.e., a product of two large prime numbers), that 2 < e < N, that e be coprime to φ(N), and that 0 ≤ C < N.
The Texas Instruments signing key controversy refers to the controversy which resulted from Texas Instruments' (TI) response to a project to factorize the 512-bit RSA cryptographic keys needed to write custom firmware to TI devices.
RSA | RSA (algorithm) | Year 2000 problem | Waring's problem | The Final Problem | The Problem with Popplers | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Species problem | RSA Security | RSA Insurance Group | RSA Conference | problem solving | Problem gambling | Packing problem | packing problem | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem | Undecidable problem | Travelling salesman problem | travelling salesman problem | The Problem of Thor Bridge | The Problem of the Media: U.S. Communication Politics in the 21st Century | The Problem of Social Cost |