The post delves into the intricacies of the RSA algorithm, tracing its evolution from its introduction in 1978 to addressing vulnerabilities discovered over the years. It explains the mathematical principles underlying RSA, various types of attacks that have been identified, and the implementation of countermeasures such as different padding schemes (PKCS#1 v1.5, OAEP) and digital signature protocols (PSS). The discussion highlights the importance of proper implementation to maintain security, including the transition to optimal asymmetric encryption padding (OAEP) and probabilistic signature schemes (PSS) to prevent modern cryptographic attacks.
Table of contents
Table of ContentsPrerequisitesThe Alice-Bob ParadigmThe Birth of the RSA CryptosystemRSA OperationsIssues with Euler’s Totient Function in RSAThe Carmichael FunctionIssues with Raw RSAExploiting Textbook RSA’s Determinism and MalleabilityLow-Exponent AttacksHåstad’s Broadcast Attack: Low Exponent Meets Multiple RecipientsIntroduction to Padding Schemes in RSAPublic Key Cryptography Standards (PKCS#1 v1.5)The Bleichenbacher AttackOptimal Asymmetric Encryption Padding (OAEP)Why SHA-1 or MD5 Are Safe in RSA-OAEPAdoption in Cryptographic Libraries (PKCS#1 v1.5 vs OAEP)Enhancing Digital Signatures: The Transition to PSSThe Road Ahead: Assessing RSA’s Long-Term ViabilityReferencesSort: