RSA problem
Facts
5 properties- Instance of
- computational hardness assumption
- Field of work
- cryptography[2]
- Has use
- RSA cryptosystem[6]
- Described by source
- Security Engineering: A Guide to Building Dependable Distributed Systems, 2nd edition[7]
- Named after
- Ron Rivest, Leonard Adleman, Adi Shamir[3][4][5]
- Freebase ID
- /m/0595kn
- Microsoft Academic ID (discontinued)
- 2780544561
Named after 3
Field of work 1
Has use 1
Instance of 1
0 sources
Summary
RSA problem is a computational hardness assumption[1].
Body
History and Context
Things named after include Ron Rivest[3], a mathematician[8], b. 1947[9], of United States[10], awarded the Turing Award[11], specialised in computer science[12]; Leonard Adleman[4], a computer scientist[13], b. 1945[14], of United States[15], awarded the Turing Award[16], specialised in cryptography[17]; and Adi Shamir[5], a mathematician[18], b. 1952[19], of Israel[20], awarded the Israel Prize[21], specialised in informatics[22].