RSA problem

Summary

RSA problem is a computational hardness assumption^[1]. It draws 75 Wikipedia views per month (computational_hardness_assumption category, ranking #1 of 3).^[2]

Key Facts

• RSA problem's field of work was cryptography^[3].
• RSA problem's instance of is recorded as computational hardness assumption^[4].
• Ron Rivest is named after RSA problem^[5].
• Leonard Adleman is named after RSA problem^[6].
• Adi Shamir is named after RSA problem^[7].
• RSA problem's has use is recorded as RSA^[8].
• RSA problem's Freebase ID is recorded as /m/0595kn^[9].
• RSA problem's described by source is recorded as Security Engineering: A Guide to Building Dependable Distributed Systems, 2nd edition^[10].
• RSA problem's Microsoft Academic ID is recorded as 2780544561^[11].

Body

Designation and Status

RSA problem's instance of is recorded as computational hardness assumption^[4].

History and Context

Things named after include Ron Rivest^[5], a mathematician^[12], b. 1947^[13], of United States^[14], awarded the Turing Award^[15], specialised in computer science^[16]; Leonard Adleman^[6], a computer scientist^[17], b. 1945^[18], of United States^[19], awarded the Turing Award^[20], specialised in cryptography^[21]; and Adi Shamir^[7], a mathematician^[22], b. 1952^[23], of Israel^[24], awarded the Israel Prize^[25], specialised in informatics^[26].

Why It Matters

RSA problem draws 75 Wikipedia views per month (computational_hardness_assumption category, ranking #1 of 3).^[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[27]