Passive and Active Security Attacks

still and Active Security Attacksautonomic nervous system - The difference between progressive and unresisting attacks in case of active attack involve the updating upon the entropy operator the active attack admittance the information and then bring to pass alteration upon the entropy and than data transmit on the network exactly in case of passive attack the assailant just get to the nitty-gritty and the table of contents of the heart and soul without whatever alteration upon the data means just type attack just involve to read and glide slope the message the content mean just observe the message .The active attack easy to detect but not easy to cheer but passive attack difficult to detect easy to maintainExamples of the Active attackReplayMessage modificationDenial of servingExample of the Passive attackTraffic AnalysisQ2. List and presently define categories of security work.Ans - The various type secure gains are -AuthenticationAccess Control (Authorizatio n) entropy Confidentiality society ConfidentialityConnectionless Confidentiality4. Data faithfulnessConnection Integrity with RecoveryConnection Integrity without convalescenceConnectionless lawNon RepudiationAuthentication- the service of authentication concern with the clear to the substance ab user before receiving the data at the receiving end . Means this service hand over the government agency to authenticate the receiving of data after confirming the data coming from the valid user.Access Control - after authentication the adjacent task is introduction control means when user request to regain the specific data then after perform authentication just next task to check the privileges of user what type of task user can be perform and what type of Resources can be access by the user . user can capable to read the contents of the data andData Confidentiality- This service basically call to provide the self-assurance the data receive by the receiver not be access and re ad by both other person during data transmitting mean the content of the msg not view by any other person.The type of data confidentiality-Connection Confidentiality- Refer to protect the data of all the during from read the content of the data on the lodge.Connectionless confidentiality - Refer to providing the shield from accessing the data of all the user on the Block of data.Data Integrity - Refer to sure that the data receive by the receiver not be updating during the transmission by any other unrecognized person . mean the data receive by the receiver the substantial data that is send by the sender.The following the types of the data integrityConnection integrity with recovery-Provide the integrity upon the data during transmission on the connection if there is any updation detect then also recover the message from the alteration and convert into the literal contents.Connection integrity without recovery- refer to providing the integrity upon the data but not providing t he recovery upon the data.Connectionless data integrity- provide integrity upon the block of data also prevent if any alteration performed but not recover the message.Non repudiation - refer to provide confidence to the sender the data receive by the receiver is the actual receiver and also provide confidence in the receiver stance the data send by the actual sender.Q3. Is there any bother with the wholeness-time pad enter? Discuss the Problems.Ans - yes there is problem with one time pad exercise -Despite Shannons proof of its security, the one-time pad has atrocious drawbacks in practiceit requires perfectly random one-time pads, which is a non-trivial software fatalitysecure generation and exchange of the one-time pad material, which must be at least as long as the message. (The security of the one-time pad is all as secure as the security of the one-time pad winder-exchange).careful interposition to make sure that it continues to remain secret from any adversary, and i s disposed of mighty preventing any reuse in whole or part therefrom one time. See data reminisce for a discussion of difficulties in completely erasing information processing system media.Q4. Define types of attacks based on what is roll in the hayn to the attacker.Ans- The following are the typed of on the based on the known to the attackerCipher Text OnlyKnown Plain schoolbookChosen Plain school schoolbookChosen suppose textbookChosen TextCipher Text Only - in this type attack the attacker only know the algorithmic program utilise to encrypt the message from seeminglytext to view text .and also known the grave text and try to be convert the nonexistence text into the theater of operations text by using the brute forte attack if the key length if too large than this attack to be used no possible then require to be use the crypt analytical way .Known Plaintext - in this attack attacker know the algorithm , cipher text and also know having idea and some of knowledge of the plain text and upon the bases of the knowing plain text generate the cipher text and contain the key to be use to convert the message from plaintext to cipher text.Chosen Pain text - in this attack attacker know the algorithm , cipher text and also also having some of the chosen plain text and also having the cipher text of the plain text with the key used to convert the plain text into the cipher textChosen cipher text - in this attacker know the algorithm , cipher text and also known the cipher text that to be chosen and also having the plain text and also the key that use to convert the cipher text into the plain text.Chosen Text- in this type of attack attacker know the algorithm , cipher text , and also some of plain text and also conversion into the cipher text included key and also having the some chosen cipher text pain with also having the plain text of all the message and also having key information.Q5. Write a Program to implement unravel fair cipher?Ans - /* Progra m to implemencryptiont ppfair cipher */includecryptionincludecryptionvoid main() singe pp55,encryption10,decryption10,data110,kk10,str26=abcdecryptionfghijklmnopqrstuvwxyzint i,j,k=0,m=0,l,flag=0,lencryption,onx,ony,twx,twychar on,tw,temp1,temp2clrscr()/* Reading the plain text */printf(n encryptionter the data1 )gets(data1)/* Reading the kk */printf(n encryptionter the kkword )gets(kk)/* Implemencryptionting the algorithm */for(i=0ij=0while(jon=kkjj++tw=kkjif(on==tw)while(kkj+1= useless)kkj=kkj+1j++kkj=NULLprintf(n t modified kk is )puts(kk)for(i=0ifor(j=0jif(kkk=NULL)ppij=kkkk++elseppij=NULLlencryption=strlencryption(kk)l=0for(i=0ifor(j=0jif(ppij==NULL)flag=0for(k=0kif((strl==kkk)lflag=1 breakingif(flag==1)l++jelseppij=strll++printf(n)for(i=0ifor(j=0jprintf(t %c,ppij)printf(n)for(i=0ij=0while(jon=data1jj++tw=data1jif(on==tw)data1j=xtemp1=data1++jdata1j=twwhile(data1j=NULL)temp2=data1++jdata1j=temp1temp1=temp2data1++j=NULLprintf(n t modifed data1 )puts(data1)i=0j=0while(data1i= NULL)on=data1ii++if(data1i=NULL)tw=data1ii++elsetw=xfor(k=0kfor(m=0mif(ppkm==on)onx=kony=mif(ppkm==tw)twx=ktwy=mif(twx==onx)encryptionj=pponx(ony+1)%5j++encryptionj=pptwx(twy+1)%5j++else if(twy==ony)encryptionj=pp(onx+1)%5onyj++encryptionj=pp(twx+1)%5twyj++elseencryptionj=pponxtwyj++encryptionj=pptwxonyj++encryptionj=NULL// encryptioncrypted data1printf(n t encryptioncryted data1 is )puts(encryption)// decryptioncrypting the givencryption encryptioncrypted data1i=0j=0while(encryptioni=NULL)on=encryptionii++tw=encryptionii++for(k=0kfor(m=0mif(ppkm==on)onx=kony=mif(ppkm==tw)twx=ktwy=mif(twx==onx)ony=ony-1twy=twy-1if(ony==-1)ony=4if(twy==-1)twy=4decryptionj=pponxonyj++decryptionj=pptwxtwyj++else if(twy==ony)onx=onx-1twx=twx-1if(onx==-1)onx=4if(twx==-1)twx=4decryptionj=pponxonyj++decryptionj=pptwxtwyj++elsedecryptionj=pponxtwyj++decryptionj=pptwxonyj++decryptionj=NULL// decryptioncrypted data1printf(n t decryptionncryptioncryted data1 is )puts(decryption)getch()Q6. Given the speed of a current ordinary computer (for home or light smear use), estimate the amount of time necessary to crack a stilbesterol encryption by testing all 256 possible keys. Make a similar estimate for a 128-bit AES key.Ans - We assume that the household computer has a 2GHZ processor. Also we assume that a machine takes a atomic number 6 cycles per brute force against a single 56-bit DES key or 128 bit AES key.To crack a DES encryption, we need(256 key)* nose candy cycles/60sec/60min/24hour/365days/2000000000hz = 114.246566yearsTo crack a AES encryption, we need(2128 key)*100 cycles/60sec/60min/24hour/365days/2000000000hz = 5.39514154 -1023 years