Parallelized RSA Algorithm: An Analysis With Performance Evaluation - - PowerPoint PPT Presentation

Parallelized RSA Algorithm: An Analysis With Performance Evaluation using OpenMP Library in High Performance Computing Environment

• Md. Ahsan Ayub, Zishan Ahmed Onik, Steven Smith

Department of Computer Science Tennessee Technological University {mayub42, zonik42, smsmith23}@students.tntech.edu

De December 19, , 2019

• Introduction
• Methodology
• Results
• Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 2 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Content

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 3 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Basic Encryption

Introduction (1/4) Methodology Results Conclusion

C= E_K(M)

Key = shift +4

M = D_K(C)

Key = shift -4

M = “ABC” C = “EFG” M = “ABC”

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 4 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Symmetric Encryption

Introduction (2/4)

• The encryption / decryption keys are the same (K)
• An example of symmetric key encryption based

communication –

• Alice and Bob agree on a cryptosystem (e.g. AES)
• Alice and Bob agree on a (secret) key K
• Alice encrypts a message using K and she sends it to Bob

C = E_K(M)

• Bob decrypts the message using K, M = D_K(C)
• Faster implementation

Methodology Results Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 5 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Asymmetric Encryption

Introduction (3/4)

• There are two different keys (K1, K2)
• It is not possible (or computationally feasible) to

calculate K1 given K2 or vice versa

• Encryption with one key, decryption with the other key
• An example –
• Alice and Bob agree on a public-key crypto system (e.g., RSA)
• Bob’s public key PKb is sent to Alice
• Alice encrypts a message with Bob’s public key and sends it
• Bob decrypts the message using his private key SKb
• Slower implementation

Methodology Results Conclusion

• The process of encrypting and decrypting a message

will be computationally feasible.

• Deriving the private key from the public key of a

particular user should be computationally infeasible.

• Deriving the private key from a chosen plaintext should

also be computationally infeasible.

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 6 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Goals: Asymmetric Encryption

Introduction (4/4) Methodology Results Conclusion

Methodology

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 8 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

RSA Algorithm

Introduction Methodology (1/3) Results Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 9 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

A Use Case of RSA Algorithm

Introduction Methodology (2/3) Results Conclusion

• Due to the benefits of the RSA algorithm, the necessity
• f faster implementations will continue to grow.
• In our study, we parallelize the exponentiation
• perations of the RSA algorithm in a high performance

computing environment.

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 10 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Our Major Contribution

Introduction Methodology (3/3) Results Conclusion

Results

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 12 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Experimental Parameters

Introduction Methodology Results (1/3) Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 13 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Experimental Findings

Introduction Methodology Results (2/3) Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 14 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Experimental Findings (Cont.)

Introduction Methodology Results (3/3) Conclusion

Conclusion

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

• Different avenues of the RSA parallelization techniques

discussed in our paper (a survey of 1978 till date)

• Parallelize exponentiation operation of the RSA algorithm

using OpenMP library in HPC environment

• RSA is not a classic parallelizable problem, e.g., Matrix

Multiplication

• In the spirit of open science, our developed tool has made
• pen source and available online at –

https://github.com/AhsanAyub/RSAParallelization

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 16 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Summary

Introduction Methodology Results Conclusion (1/3)

• Incorporating the Chinese Remainder Theorem (CRT) to
• ptimize modular operations
• Utilizing another high performance message passing

computing library, such as, Message Passing Interface (MPI), and then provide a comparison

• Focusing on GPU-based implementation

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 17 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Future Work

Introduction Methodology Results Conclusion (2/3)

• Anonymous reviewers
• Dr. Ambareen Siraj and Dr. Sheikh Ghafoor
• Professor, Dept. of Computer Science, Tennessee Tech University
• Cybersecurity Education, Research and Outreach Center

(CEROC) at Tennessee Tech University

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 18 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

Acknowledgement

Introduction Methodology Results Conclusion (3/3)

ht https://w ://www.tnt ntech. h.edu/c u/ceroc | @TechC hCEROC | ceroc@tnt ntech. h.edu 2019 2019 22n 22nd Internat atio ional al Confe ference of f Compu puter an and Info format atio ion Technolo logy (ICCIT)

THANK YOU!

Happy to take any questions you may have!