Problem 44964. Optimal Asymmetric Encryption Padding of message for RSA Cryptography
Solution Stats
Problem Comments

3 Comments
Hi, David, is the problem description right? Seems that section 9.1.1 has the EMEOAEPencode/decode pair, while 7.1.1 is another function that uses EMEOAEP, but it is not it. Moreover, how do we apply the Feistel network inside the MGF1 (disjoint sets or with intersection: 1,1,2,2,3,3,..., n n or 2 3 4 .. .n 1)? And how many rounds? 2 or more? Should the Feistel network replace the MGF1 function? Could you, please, explain?
Yes, changed description to the proper section 9.1.1.1. The steps show how the MGF1 function is used. Look at figure 1. There are not multiple rounds.
Thanks, David. I've struggled for a while with this problem but I've finally figured it out. First, although we don't use the encryption function from 7.1.1, we must create an output EM of length k1 and apply a pad of 0 as the first character of EM (It was strange to see all hashes starting with 0). Next, I was confused with the Feistel Network, because my MGF from the previous problem wasn't working (an accepted solution), but I realized that you were probably using a hex input, instead of char (which is weird since the MGF function requires an Octect String as input), but anyway that solved it. :)
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems

Remove all the words that end with "ain"
2208 Solvers

Test if a Number is a Palindrome without using any String Operations
227 Solvers

Project Euler: Problem 5, Smallest multiple
1277 Solvers

Duplicate each element of a vector.
597 Solvers

Find mistyped words in text (mixedup letters)
160 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!