4 views

Uploaded by Nir Infosys

Computer

- Bsc it 62 E-Commerce
- Unit-2=Security Threats to E-business-15 May 2011=
- Computer Security by William Stalling Ch 2 MCQ
- KEY-AGGREGATE SECURE DATA SHARING IN CLOUD COMPUTING FOR CRYPTOSYSTEM
- article9.pdf
- A Performance Analysis of DES and RSA.pdf
- [IJETA-V5I1P7]:Kholoud Sweekat, Fatema Zarka, Boushra Maala, Ahmad S. Ahmad
- Principles of Cryptography
- Key Aggregate
- E-mail
- ch19
- ch19.ppt
- Dna Computing final part
- Combining Private and Public Key Encryption Techniques for Providing Extreme Secure Environment for an Academic Institution Application
- Security
- a
- Implementation of Simple Data Encryption Standard
- DATA ENCRYPTION USING BIO MOLECULAR INFORMATION.pdf
- Plastic Money
- Ambros in 2016

You are on page 1of 23

By : Chavda Vijay N.

The message may get leaked in the pathway. Someone might get access to the data stored on computer. In large networks, if A is supposed to send message to B, there is a threat of following types of security attacks :

A C

(b) Interruption

(c) Interception

(d) Modification

(e) Fabrication

The key must remain secret at both ends. In a large network, there are many key pairs to be managed. Sound cryptographic practice demands that the key be changed frequently and perhaps for each communication session. Need of unconditionally secure channel for key distribution.

Do we have a solution?

Yes, PUBLIC KEY ENCRYPTION. Salient features of this encryption are: It is computationally infeasible to determine the decryption key given only knowledge of the cryptographic algorithm and the encryption key. Either of the two related keys can be used for encryption, with the other used for decryption.

Confidentiality

Authentication

A encrypts the message using As private key. (authentication) The messages is again encrypted using Bs public key. B decrypts the message first using Bs private key. (confidentiality) The message is again decrypted using As public key.

Message source Encryption Algorithm

Encryption Algorithm Decryption Algorithm

Decryption algorithm

Message

destination

As private key

Bs public key

Bs private key

Key Pair Source

As public key

p, q two prime numbers (private, chosen) n = pq (public, calculated) e, with hcf ((n),e) = 1; 1<e<(n) where Euler Totient function (n) = (p-1)(q-1) = no. of integers relatively prime to n. (public, chosen) d e-1 mod (n) (private, calculated)

For some plaintext block M and ciphertext block C Encryption: C = Me mod n Decryption: M = Cd mod n = (Me)d mod n = Med mod n

One of the requirements of the RSA algorithm is : Med M mod n = M By Euler Totient Theorem, Mk(n)+1 = Mk(p-1)(q-1)+1 M mod n Thus, ed = k(n) + 1 According to rules of modular arithmetic , this is true only if d and e is relatively prime to (n), i.e. hcf((n),d) = 1

Key Generation

Select p,q p and q both prime Calculate n = p x q Calculate (n) = (p-1)(q-1) Select integer e hcf ((n), e) = 1 ; 1 < e <(n) Calculate d d = e-1 mod (n) Public key KU = {e,n} Private key KR = {d,n}

Encryption

Plaintext: Ciphertext:

M<n C = Me (mod n)

Decryption

Plaintext: Ciphertext:

C M = Cd (mod n)

Example

Select two prime numbers, p = 7 and q = 17. Calculate n = pq = 7 x 17 = 119. Calculate (n) = (p-1)(q-1) = 96. Select e such that e is relatively prime to (n) = 96 and less than (n); in this case, e = 5. Determine d such that de = 1 mod 96 and d < 96. The correct value is d = 77, because 77 x 5 = 385 = 4 x 96 + 1.( since ed = k (n) + 1 ) The resulting keys are public key KU = {5,119} and private key KR = {77,119}.

Encryption

Plaintext: Ciphertext:

Decryption

Ciphertext: Plaintext:

Advantages

Only the private key must be kept secret. A private key / public key pair may remain unchanged for a considerable periods of time, e.g. many sessions In a large network, the number of keys necessary may be considerably smaller than in the symmetric-key scenario.

Yes, RSA also, like all other cryptographic algorithms is prone to mathematical as well as brute force attacks. One of the many possible attacks can be as described below: Let M1 and M2 be two plaintext messages and C1 and C2 be their corresponding RSA encryptions. Then, (M1M2)e M1eM2e C1C2 (mod n) Suppose, the adversary wants to decrypt ciphertext C = Me(mod n) intended for A.

Since M! (C!)d Cd(Xe)d MX ( mod n) , i.e. MX = M! ( mod n) => M = M!X-1 (mod n) This attack is known as chosen ciphertext attack. Solution: In practice some structural constraints are imposed on plaintext messages. If a ciphertext C is decrypted to a message not possessing this structure, then C is rejected by the decryptor as being fraudulent.

Factoring attack Attack on small exponent e by Gausss algorithm and using chinese remainder theorem. Forward search attack Common modulus attack Cycling attack Unconcealed message attack

Conclusion

First of all cryptography never finishes. Some breakthroughs are always made, either in encryption or in cryptanalysis. As it stands today, RSA is yet unbreakable. Public key Cryptography has replaced conventional Symmetric key Cryptosystems at most places is considered sufficiently secure for modern communications.

Thank You

- Bsc it 62 E-CommerceUploaded bysaurab_baraik
- Unit-2=Security Threats to E-business-15 May 2011=Uploaded by77ranga
- Computer Security by William Stalling Ch 2 MCQUploaded byimran
- KEY-AGGREGATE SECURE DATA SHARING IN CLOUD COMPUTING FOR CRYPTOSYSTEMUploaded byeditor3854
- article9.pdfUploaded byzivota nnn
- A Performance Analysis of DES and RSA.pdfUploaded byRamu Kuchipudi
- [IJETA-V5I1P7]:Kholoud Sweekat, Fatema Zarka, Boushra Maala, Ahmad S. AhmadUploaded byIJETA - EighthSenseGroup
- Principles of CryptographyUploaded byRakhmadhanyPrimananda
- Key AggregateUploaded byPriya Mohan
- E-mailUploaded bysudhirpratapsinghrat
- ch19Uploaded byShanmugapriyaVinodkumar
- ch19.pptUploaded byasifmalik138
- Dna Computing final partUploaded bycharu73
- Combining Private and Public Key Encryption Techniques for Providing Extreme Secure Environment for an Academic Institution ApplicationUploaded byAIRCC - IJNSA
- SecurityUploaded byConz Connie Marie Magno
- aUploaded byachuu1987
- Implementation of Simple Data Encryption StandardUploaded byArthic Rkss
- DATA ENCRYPTION USING BIO MOLECULAR INFORMATION.pdfUploaded byijcisjournal
- Plastic MoneyUploaded byBindu Mandotra
- Ambros in 2016Uploaded bySelva
- IRJET- Condense Data Replication on Encrypted File StorageUploaded byIRJET Journal
- Cryptography AssignmentUploaded byarijitsinha99
- CSEIT1831389Uploaded bySarim
- Computer Security and Cryptography A simple PresentationUploaded byAlex C Punnen
- Network Security and CryptographyUploaded bys_asmath
- stego1Uploaded byDarshan Bhatt
- New Text DocumentUploaded bydustboy
- The National Election CommitteeUploaded bynscorpio_07
- Java Cryptography Architecture (JCA)Uploaded byReghuram Rajakumar Vasanthakumari
- Design PrinciplesUploaded bytryin2blucky

- ME_college ListUploaded byNir Infosys
- Pla Implicitcerts 2008Uploaded byNir Infosys
- GetTRDocUploaded byNir Infosys
- I.T Engg Sem-VIUploaded byMuvin Koshti
- cucs-002-04Uploaded byNir Infosys
- Dtlawdtz Acio II 130713Uploaded byazazelavey
- Image MorphingUploaded byNir Infosys
- Sen10cUploaded byNir Infosys
- PKonGPU_eurocryptUploaded byNir Infosys
- Programming in C Dip Sem-I Wef 01082011Uploaded byParthiv Oza MasterMind
- C_PUploaded byNir Infosys
- GATE Online Exam-SRSUploaded byNir Infosys
- 00959859-C Compiler Design for a Network ProcessorUploaded byNir Infosys
- Se Project SrsUploaded bySumit Pandit
- Practical 7(Dijkstra)Uploaded byNir Infosys
- SRSUploaded byNir Infosys
- SRS_OJPSUploaded byNir Infosys
- Practical 8(Kanpsack)Uploaded byNir Infosys
- A Review on Quantum Cryptography TechnologyUploaded byBoonsap Witchayangkoon
- Formal Methods FM06Uploaded byNir Infosys

- ITN_instructorPPT_Chapter2_final.pptxUploaded byEmaPermanaSari
- Parallel Implementation of Classification Algorithms MapReduceUploaded byHouda Kamouss
- DNS-320_B1_Manual_v1-00(WW)Uploaded byvenkat_nz
- PassLeader 70-532 Exam Dumps (91-120)Uploaded bymickey_dt
- ACM TaxonomyUploaded byRicardo Rubik Ruiz
- All in 1 Basic TutorialsUploaded byM Nur Fajarial
- Tips and Techniques for Wind WorkflowUploaded byRonald
- 29646761 Cics MainframesUploaded byRohit Jaiswal
- Informative SpeechUploaded byasdf asdf
- Info Tech Final ExamUploaded byFretch Aballe Miranda
- Exchange Server 2013 Interview QuestionsUploaded byMuthu Ranganath
- Texas Instrument - Ti89 Ti92 Plus Developer GuideUploaded byapi-3820030
- ToolboxUploaded bymrloadmovie
- Git Source Control;Visual Studio 2010;dropboxUploaded byjavarwoki
- Practical Solid Modeling for 3d Printing With Openscad 2013-09-25Uploaded bytesla-dax
- WL-203 MFP Server Full Manual [UK]Uploaded byJan Herman Veldkamp
- CUDA Binary UtilitiesUploaded byavp
- JAVAUploaded byDeepa Gokhale
- Deploy Operating Systems Using MDT 2013Uploaded byHudson Gonçalves Siqueira
- dataAcquationReport.docxUploaded bymanjues
- Abstract CsdUploaded bySARATH MOHANDAS
- Oracle Database: Introduction to SQL Ed 1.1Uploaded byengamira22
- SAP CRM Technical Tutorials by Naval Bhatt._ Interview Questions ...Uploaded byVamsi Varun
- ben1.pdfUploaded byMaria Mashor
- Orient DbUploaded byDiana Burca
- Basis TipsUploaded byvmuthukumaar
- CMI Guidelines for InteroperabilityUploaded byAnonymous i632Db4vgZ
- Java Interview QuestionUploaded byajitkarthik
- Vsp 4 San Design DeployUploaded byDhaneesh Kpba
- REFF2.pdfUploaded byXavier Danny