Data Compression and Encryption by Team, Ques10

by Team, Ques10 · Views: 150 · Format: EPUB · Language: English (en)

Cover of Data Compression and Encryption by Team, Ques10 — Free EPUB on AnyEbooksEPUB

of Algorithm: The scheme developed by Rivest, Shamir and Adleman makes use of an expression with exponentials. Plaintext is encrypted in block having a binary value than same number n. Block Size ≤ log 2 ( n ) ≤log2⁡(n) If block size=1 bits then, 2 1 ≤ n ≤ 2 i + 1 21≤n≤2i+1 Encryption and decryption are of following form for same plaintext M and ciphertext C. C = M e m o d n C=Memodn M = C d m o d n M=Cdmodn M = ( M e ) d m o d n M=(Me)dmodn M = M e d m o d n M=Medmodn Both sender and receiver must know the value of n. The sender knows the value of e, and only the receiver knows the value of d. Thus this is a public key encryption algorithm with a public key of PU= {c, n} and private key of PR= {d, n}. 5. RSA algorithm as shown below: a) Key Genration : Select p,q…….. p and q both are the prime numbers, p≠q. Calculate n=p×q Calculate q(n) = (p-1) (q-1) Select integer….g(d ( (n), e)) =1 & 1 Ciphertext: C c) Decryption: Ciphertext: C Plaintext : M= Cd mod n Note 1 : (n) -> Euler’s totient function Note 2: Relationship between C and d is expressed as: ed (mod (n))=1 ed = 1 mod (n) d = e − 1 e−1 mod (n) 6. Example: Key Generation : Select 2 prime numbers -> p=17 and q=11 Calculate n = p×q =17 ×11=187 Calculate = 16 × 10= 160 Select ‘e’ such that e is relatively prime to (n)=160 and e < Determine d such that : de =1 mod (n) d × 7 = 1 mod 160 ↓ ↓ 161 161 d = e −

★★★★★

Rate this eBook

File Name:4be9e5a02d31578f1f08369b27410999.epub
Original Title:Data Compression and Encryption
Creator / Author:Team, Ques10
Language:English (en)
Identifier:ASIN:291335
Publisher:Team, Ques10 Publishing
Category:Fiction
Format:📗 EPUB eBook
File Size:3.5 MB

Community Reviews

Loading verified community reviews...
✍️
Verified Author
View All Books by Author →

Related Fiction Titles