RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149070 |
| _version_ | 1826217465553616896 |
|---|---|
| author | Chor, Benny Goldreich, Oded |
| author_facet | Chor, Benny Goldreich, Oded |
| author_sort | Chor, Benny |
| collection | MIT |
| first_indexed | 2024-09-23T17:04:06Z |
| id | mit-1721.1/149070 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T17:04:06Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1490702023-03-30T03:01:28Z RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure Chor, Benny Goldreich, Oded 2023-03-29T14:24:32Z 2023-03-29T14:24:32Z 1984-05 https://hdl.handle.net/1721.1/149070 14440122 MIT-LCS-TM-260 application/pdf |
| spellingShingle | Chor, Benny Goldreich, Oded RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title | RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title_full | RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title_fullStr | RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title_full_unstemmed | RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title_short | RSA/RABIN Least Significent Bits Are 1/2 + 1/poly(logN) Secure |
| title_sort | rsa rabin least significent bits are 1 2 1 poly logn secure |
| url | https://hdl.handle.net/1721.1/149070 |
| work_keys_str_mv | AT chorbenny rsarabinleastsignificentbitsare121polylognsecure AT goldreichoded rsarabinleastsignificentbitsare121polylognsecure |