Randomized Encryption Techniques
A randomized encryption procedure enciphers a message by randomly choosing a ciphertext from a set of ciphertexts corresponding to the message under the current encryption key. At the cost of increasing the required bandwidth, such procedures may achieve greater cryptographic security than their det...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149044 |
| _version_ | 1826198013067919360 |
|---|---|
| author | Rivest, Ronald L. Sherman, Alan T. |
| author_facet | Rivest, Ronald L. Sherman, Alan T. |
| author_sort | Rivest, Ronald L. |
| collection | MIT |
| description | A randomized encryption procedure enciphers a message by randomly choosing a ciphertext from a set of ciphertexts corresponding to the message under the current encryption key. At the cost of increasing the required bandwidth, such procedures may achieve greater cryptographic security than their deterministic counterparts by increasing the apparent size of the message space, eliminating the threat of chosen plaintext attacks, and improving the a priori statistics for the inputs to the encryption algorithms. In this paper we explore various ways of using randomization in encryption. |
| first_indexed | 2024-09-23T10:57:30Z |
| id | mit-1721.1/149044 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T10:57:30Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1490442023-03-30T03:57:45Z Randomized Encryption Techniques Rivest, Ronald L. Sherman, Alan T. A randomized encryption procedure enciphers a message by randomly choosing a ciphertext from a set of ciphertexts corresponding to the message under the current encryption key. At the cost of increasing the required bandwidth, such procedures may achieve greater cryptographic security than their deterministic counterparts by increasing the apparent size of the message space, eliminating the threat of chosen plaintext attacks, and improving the a priori statistics for the inputs to the encryption algorithms. In this paper we explore various ways of using randomization in encryption. 2023-03-29T14:22:24Z 2023-03-29T14:22:24Z 1983-01 https://hdl.handle.net/1721.1/149044 10175062 MIT-LCS-TM-234 application/pdf |
| spellingShingle | Rivest, Ronald L. Sherman, Alan T. Randomized Encryption Techniques |
| title | Randomized Encryption Techniques |
| title_full | Randomized Encryption Techniques |
| title_fullStr | Randomized Encryption Techniques |
| title_full_unstemmed | Randomized Encryption Techniques |
| title_short | Randomized Encryption Techniques |
| title_sort | randomized encryption techniques |
| url | https://hdl.handle.net/1721.1/149044 |
| work_keys_str_mv | AT rivestronaldl randomizedencryptiontechniques AT shermanalant randomizedencryptiontechniques |