Downloaded 124 times
Uploaded byMd. Ariful Hoque
Implementation of RSA Algorithm for Speech Data Encryption and Decryption
The document discusses the importance of cryptography in various fields such as phone communication, e-commerce, and video conferencing. It outlines the RSA cryptographic algorithm's processes of encryption and decryption, including the generation of public and private keys, and discusses the preprocessing of recorded Bangla speech words for encryption. The objective is to record and encrypt 500 speech words, ultimately turning them into unreadable messages.
More Related Content
Similar to Implementation of RSA Algorithm for Speech Data Encryption and Decryption
Implementation of RSA Algorithm for Speech Data Encryption and Decryption
- 1. Md. Ariful Hoque Roll No: MSc 140202 Discipline : CSE Khulna University
- 2. Data communication. Vitalrole of Cryptography. Phone communication. E-commerce. Pay-TV. Transmitting financial information. Video Conferencing. 2
- 3. Cryptosystem. Encryption Decryption Symmetric cryptosystem. RSA cryptographic algorithm. Uses a pair of related keys - Private key Public key 3
- 4. Record 500 Banglaspeech words. Extract data. Stored in a text file as integer data. Encrypt and decrypt. 4
- 5. Speech Word 5 Recording of Bangla speech words. Recorded as wav file. Sampling rate 8.00 KHz. Coded in 8 bits PCM.
- 6. Speech Word Preprocessing and Data Extraction 6 Discard 58 bytes from beginning. Extract require voiced data. Contain silence, unvoiced and voice. Stored in a text file.
- 7. Speech Word Preprocessing and Data Extraction Public key {e, n} 7
- 8. Speech Word Preprocessing and Data Extraction Encryption Process 8 Public key {e, n}
- 9. Speech Word Preprocessing and Data Extraction Encryption Process Private key {d, n} Public key {e, n} 9
- 10. Speech Word Preprocessing and Data Extraction Encryption Process Decryption Process Public key {e, n} 10 Private key {d, n}
- 11. Speech Word Preprocessing and Data Extraction Encryption Process Decryption Process Original Speech Word Private key {d, n} Public key {e, n} 11
- 12.
- 13. 13 Random Number Generator
- 14. 14 Random Number Generator Rand FIFO
- 15. 15 Random Number Generator Rand FIFO Primality Tester
- 16. 16 Random Number Generator Rand FIFO Primality Tester Prime FIFO
- 17. 17 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1)
- 18. 18 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1) n
- 19. 19 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1) gcd(e, ∅(n))=1 1<e< ∅(n) n
- 20. 20 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1) gcd(e, ∅(n))=1 1<e< ∅(n) e n
- 21. 21 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1) gcd(e, ∅(n))=1 1<e< ∅(n) e.d =1mod ∅(n 0 ≤d ≤n e n
- 22. 22 Random Number Generator Rand FIFO Primality Tester Prime FIFO N=p*q ∅(n)=(p-1)(q-1) gcd(e, ∅(n))=1 1<e< ∅(n) e.d =1mod ∅(n 0 ≤d ≤n d e n
- 23. 23 Publickey e n
- 24. 24 e n d n Public key Private key
- 25.
- 26. 26 M e n
- 27. 27 M e n Modular Exponentiation Me mod n
- 28. 28 M e n Modular Exponentiation C Me mod n
- 29.
- 30. 30 C d n
- 31. 31 C d n Modular Exponentiation Cd mod n
- 32. 32 C d n Modular Exponentiation M Cd mod n
- 33. 33 Input: A,B, n Output: E = AB mod n LR binary method E <= 1; for i = k-1 to 0 If Bi =1 E <= A*E mod n end if if i ≠ 0 E <= E*E mod n; end if end for return E;
- 34.
- 35. Objective. 500 speechwords recorded. Saved as .wav format. Extracted integer data. Taken txt file as input. Produce unreadable message. 35
- 36. RSA algorithm usedto encrypt and decrypt. M lies in the range . Encrypt 500 word at a time. Limitations. 36
- 37.