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

EME-OAEP encoding of input message using a Feistel network with SHA-1 hashing and mask generation function (MGF1) (see problem 44963/below link, section (figure 1 shows the encoding process)). Inputs will include message (M), label (L), a random seed (seed) array of octets of length 20 (needed such that outputs can be compared), and output length (k). Output (EM) array will be an array of octets of length, k. Hash length will always be 20 from SHA-1 (160-20 bytes). The character length of input message will never exceed k-42.
For example:
M = 'I like to swim.';%input
L = 'abcdefghijklmnopqrstuvwxyz';%input
seed = [147,11,108,119,5,16,236,136,93,93,38,38,89,86,200,124,118,33,226,172];%input
k = 100;%input
EM = [0,167,202,74,98,63,234,235,44,82,53,39,70,214,204,79,45,80,35,147,55,32,35,39,45,...

Solution Stats

41.67% Correct | 58.33% Incorrect
Last Solution submitted on Jan 11, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers3

Suggested Problems

More from this Author55

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!