Network Security and Cryptography RSA variant. Let us consider the following variant of the RSA public key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The corresponding key generation and encryption algorithms are detailed next: • Key generation KG¡(A) Generate two distinct odd primes p and q of same bit-size d - Compute N = p•q and o = (p – 1)(q – 1) - Select a random integer 1 < e <¢ such that gcd(e, ø) = 1 - Compute the unique integer d such that 1 < d < ¢ and e.d = 1 mod ¢ The public key is PK = (N, e). The private key is SK (N, e, d) %3D Encryption Enc1(PK, m) of a message m e ZN proceeds as fol- lows: Generate a random integer r in ZN - Compute îm =m•r mod N - Compute ci = mº mod N Compute c2 =r=e mod N %3D - Output C = (c1, c2) %3D (a) Give the corresponding decryption algorithm Dec1 (SK,C). Prove your decryption algorithm is correct, i.e. given a legitimate key pair (PK, SK) + KG|(A) it holds that Dec1 (SK, Enc1(PK,m)) m for any admissible plaintext m. (b) Is the public key encryption scheme RSA-M1 one-way? Justify your answer.
Network Security and Cryptography RSA variant. Let us consider the following variant of the RSA public key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The corresponding key generation and encryption algorithms are detailed next: • Key generation KG¡(A) Generate two distinct odd primes p and q of same bit-size d - Compute N = p•q and o = (p – 1)(q – 1) - Select a random integer 1 < e <¢ such that gcd(e, ø) = 1 - Compute the unique integer d such that 1 < d < ¢ and e.d = 1 mod ¢ The public key is PK = (N, e). The private key is SK (N, e, d) %3D Encryption Enc1(PK, m) of a message m e ZN proceeds as fol- lows: Generate a random integer r in ZN - Compute îm =m•r mod N - Compute ci = mº mod N Compute c2 =r=e mod N %3D - Output C = (c1, c2) %3D (a) Give the corresponding decryption algorithm Dec1 (SK,C). Prove your decryption algorithm is correct, i.e. given a legitimate key pair (PK, SK) + KG|(A) it holds that Dec1 (SK, Enc1(PK,m)) m for any admissible plaintext m. (b) Is the public key encryption scheme RSA-M1 one-way? Justify your answer.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
I need the answer as soon as possible
![Network Security and Cryptography
4. RSA variant. Let us consider the following variant of the RSA public
key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The
corresponding key generation and encryption algorithms are detailed
next:
Key generation KG|(A)
Generate two distinct odd primes p and q of same bit-size X
Compute N = p.q and o = (p– 1)(q – 1)
Select a random integer 1 < e < o such that ged(e, 6) = 1
- Compute the unique integer d such that 1 <d < ¢ and
e.d = 1 mod o
(N, e). The private key is SK
The public key is PK
(N, e, d)
Encryption Enc1 (PK, m) of a message m e Zy proceeds as fol-
lows:
Generate a random integer r in Z
- Compute îm = m ·r mod N
- Compute ci
Compute c2 =r¯emod N
- Output C = (c1, C2)
-
me mod N
(a) Give the corresponding decryption algorithm Dec1 (SK,C). Prove
your decryption algorithm is correct, i.e. given a legitimate key
pair (PK, SK) +t KG|(A) it holds that Dec1 (SK, Enc1(PK, m)) =
m for any admissible plaintext m.
(b) Is the public key encryption scheme RSA-M1 one-way? Justify
your answer.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2a7b87ca-0c8f-4e14-8aa3-bf7cbfc74fe7%2F7bc15236-9dbd-4128-a4c8-e160c51fdd25%2F5x5clb_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Network Security and Cryptography
4. RSA variant. Let us consider the following variant of the RSA public
key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The
corresponding key generation and encryption algorithms are detailed
next:
Key generation KG|(A)
Generate two distinct odd primes p and q of same bit-size X
Compute N = p.q and o = (p– 1)(q – 1)
Select a random integer 1 < e < o such that ged(e, 6) = 1
- Compute the unique integer d such that 1 <d < ¢ and
e.d = 1 mod o
(N, e). The private key is SK
The public key is PK
(N, e, d)
Encryption Enc1 (PK, m) of a message m e Zy proceeds as fol-
lows:
Generate a random integer r in Z
- Compute îm = m ·r mod N
- Compute ci
Compute c2 =r¯emod N
- Output C = (c1, C2)
-
me mod N
(a) Give the corresponding decryption algorithm Dec1 (SK,C). Prove
your decryption algorithm is correct, i.e. given a legitimate key
pair (PK, SK) +t KG|(A) it holds that Dec1 (SK, Enc1(PK, m)) =
m for any admissible plaintext m.
(b) Is the public key encryption scheme RSA-M1 one-way? Justify
your answer.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education