Timeline for RSA-OAEP: How does it work?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 7, 2021 at 7:59 | history | edited | CommunityBot |
replaced https://tools.ietf.org/html/rfc with https://www.rfc-editor.org/rfc/rfc
|
|
| Jan 29, 2018 at 8:09 | comment | added | Bao HQ | seed length equals hLen, the result of hashing seed is something its length depends on hash algorithm (sha1: 20 bytes, sha256: 32 bytes...). how it can be k - hLen - 1 as PKCS#1 said? | |
| Jan 28, 2016 at 22:02 | vote | accept | 今天春天 | ||
| Jan 28, 2016 at 18:52 | comment | added | fgrieu♦ | @今天春天: yes, except that what you call "standard RSA" is hardly standardized (though close to PKCS#1v1.5 format 0), and usually is called textbook RSA encryption, RSA encryption with no padding, (textbook|raw|bare|naked) RSA public-key|encryption primitive|function. More strictly speaking, RSA Encryption Primitive , noted RSAEP, is step 3b). | |
| Jan 28, 2016 at 17:33 | comment | added | 今天春天 | ...the EM is given to the standard RSA? | |
| Jan 28, 2016 at 16:40 | history | answered | Maarten Bodewes♦ | CC BY-SA 3.0 |