Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
100%
(2)
100% found this document useful (2 votes)
2K views
191 pages
Cns Spectrum
Uploaded by
saisudhir1728
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save Cns Spectrum For Later
100%
100% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
100%
(2)
100% found this document useful (2 votes)
2K views
191 pages
Cns Spectrum
Uploaded by
saisudhir1728
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save Cns Spectrum For Later
100%
100% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 191
Search
Fullscreen
NETWORK SEX" — —$—$__“ABy 2 _____—_ nr TOGRARHY AND NET H SOLUTIONS | ‘PART-A SHORT QUESTIONS WIT! | 6 yarns oni. | - te Be i What are the principles of security? May TRA), oy 1 oy | Answer : stem and the information nisms, the security of a data processing employing one OF MOTE S Assccurity senive isa service that is used to enhance curity mech ‘within an organization. They are meant io tackle security atta The available security services are as follows, 1 Confidentiality | Authentication a Neo-repudiation Integr S.Availability 6 Access con Q2. Define confidentiality and authentication. Answer: ApalsHR8 coy Confidentiality . tH Confidentiality refers to the process of protecting the data being transmitted from all types of passive-attacks. In cae the release of message cortenis, higher levels of protection can be notified. All the data which is transmitting between tht systems for some specific period of time can be protected in ease of broader forms of this service. Far example, in ease of sina connection benween the two systems, any user data can be prevented ftom its release over the virtual cite a also be applied ina narrower form which protects a single message or some fields within the message but this appeasch is eae complex end expensive to implement. Another feature of confidentiality is protecting traffic low from analysis because of «8 ‘an intruder cannot monitor the source and destination, frequency, length and any other trafic characteristics Authentication i {t deals withthe process of assuring thatthe communication is authentic. In ease of < a uthentic, In ease of a single messa, function io ensue the ecient that th mevsage som the intentad voces Foro ae ese to host connection, two perspectives are involved. “—, ansmissee ® Faction such as the ()___Initiaily atthe time of connection establishment, the authentication service - ‘Must ensure the authentic} parties involved. ture the authentic of two communion G3. Differentiate between interruption and interception, Answer : Interruption (Modal Papers atja) | Dec 1A 16S This is an attack on availability hich the resourses ofa co computer sytem are damaged or become unavailable =| Gay Figure: nterrupion Examples: Dariage 0 some portion ofthe hardware cuting of comay one HCALION Hine ety, ete. WARNING: xeraePhotetopying of books 8 CRAIRAL set. An sauna SRY ABLE tp 188 LEGAL procuediogs Sead ih CamSeorrarthe confidentiality of information where an Person or program gets the access or control 10 Tesources, ‘Ss0uRcE DESTINATION INTRUDER Figure: Interception Wiretapping of a network, illicit copying of files Short notes on viruses. Model Paper, (a) is a software program that replicates itself $ another computer without the knowledge of user. Virus gets its pame from biological virus. For itself, a virus needs to execute code and should be ‘memory. For this reason, many viruses attach executable files that are part of authentic program. Propagates by transmitting itself across network security system. Viruses are otherwise said to be (idle) until certain events cause their code 10 ‘Virus also propagates from one system to another ost is taken to an uninfected system, They are attachments in e-mail message or in downloaded are the different types of viruses? ¢ of the different types of viruses are as follows, Virus ‘of the most common types of virus. It attaches ‘fo executable files like .com and .exe in order to ae. When the program that is infected is executed, ned copy of parasitic virus is ble files. dent Virus viruses load themselves into the memory during of infected program and transfer the control ted host program. In this ease, virus infects being executed on the Q6. Define non-repudiation. Answer ee. -47(R13), 18) Non-tepudiation provides protection against the denial by one ofthe entities involved in communication, Thus, once 8 message is sent, the receiver assures that the message was se by an intended sender and upon reception, the sender assures ‘that the message is received by the correct receiver Q7. What are the types of security attacks? oe May-16(R13), Q1(a) ‘Attacks on the security of a system or a network can be best described by analyzing the functionality of a computer system by providing the required information. The two different types of attacks that are possible are, 1, Passive Attacks It refers to the process of monitoring or wiretapping of the ongoing transmission. Here, the goal of the opponent is to capture the transmitting information. Two possible types of passive attacks are, (i) Release of message contents ii) Traffic analysis. 2. Active Attacks Inthis type of attack, an attacker can alter the information fr sometimes generates fraudulent information into the network. The four categories of the active attacks are as follows, (i) Masquerade Gi) Replay (iii) Modification tiv) Denial of service Fe i edn Q8. Discuss about Masquerade in brief. Answer : Dec. -199R16), O40) ‘This type of attack occurs when one entity counterfeits to bea different entity. usually includes the other types of ‘active attack. Consider an example, where the authentication Sequences can be seized and replayed after the occurrence of 4 valid authentication sequence thereby allowing an autho- {ized entity with limited privileges to get additional privileges by Pretending to be an entity that has these benefits Attacker sending messages to User? ‘Sona with CamSernarQ9, What ara 8 . Auawer t . MortHR48) ay) Some of the ypeeltic yecuslty mechanisms wre an follows Om catsily vgcensile, Th depen on the appl A DigHiat Signatures the appended data or ‘oF tes cat and prevents i from any wunuthorized IW rofers to a variety of techniques cts Haste tothe proccas af applying mtematial gorithms for converting Asta ino & form tha is yy Falgoritinn and the encryption Keys. applied to any data unit must preserve the integrity syplogenphie transform eves. 1 are usually employed for enforeing access permissions to th Alt) Aecens Cont my resources dejgltys I vefers toa variety of techniques th ofa at ensure the integrity of data, wy of either a sender or a receiver by exchanging (9) Authenttention information between thes (ob ‘rule Pudding: The process of inserting bits into a data steam to thwart trie analysis aterpts: (old Routlny: Control selects route thats assumed to safe for transmiting certain amount of data and immediately changes the route once a breach in security is detected, (olll_Notarlzatlow: ttrefers to the nt ofa trusted thied party for assuring some specific properties of a data exchange, Q10. Explain tho notwork socurity model. wring the iden Answer t OctsNov-16{R13}, 2119) Generally, the data which is in the form of a stream or a block can be transmitted over network between the two ‘communicating parties."The entity which is responsible for transmitting the data js called a sender and the entity which receives the data (from the sender) is ealled a receiver. Both the parties must have certain level of coordination between them in ord the data, If the sender and receiver are linked through connection-oriented means then they must use a connection. oriented protocol ike TCPAP for transmitting the data. During the process of data transmission, some unauthorized interruption from intruders oceur which ean be avoided by providing security to the transmitting data. QM. Define linear cryptanalysis. Anower + Dee.-17(R13), tie) Linear Cryptanalysis is type of eryplanalytic attack invented by Mitsuru Matsui (1016, +015, 1017]. This attack uses tinear approximations to describe the action of a block cipher. This means that if XOR is done on some of the plain text bits together, XOR some cipher text bits together and then XOR the result, a single bit is generated that is the XOR of some of the key bits, This isa linear approximation and will hotd some probability P. Q12. What are the two basic functions used in encryption algorithms? Answer : (Model Papers, 21(b} | OctsNov.A6{R3), Q1(0)) “There are two general operations used in encryption. They are, Substitution 4 Transposition. In substitution, each leter of plaintext is replaced with some other element. In transpositio i ‘element. In transposition, the let in some strategy. These operations are performed in such a way tha no information is los. ae eee Q13, What is traffic padding? What Is its purpose? Answer : : Apesi18(R15), 0112) ‘Traffic padding can be defined as a technique to hide the ¢ Patterns of traffic, In essence, a dummy tral insertec q network ‘and presented to tenets different pattern. Now, the traflic pattem observed iy iatiadert ales fe = od sick hides the real operation mode of the system, However, the presence of di riheaed iL bes atm fo reduce the dummy traflic to attain necessary security. SAY Gn eas lot of uvertcad ead kf importmt Although there is no plain text, the traffic padding keeps on i epson generating output as ciphertext. Ths, it gene enti dat stream. n presence of plaintext, the proces of encryption akes pace tod tien win eecoaehed ee “There is also a possibility that if plaintext is not provided, then data is 0a pos hat if 'n data is encrypted and transmitted randomly. As a result, the attacker fails to identify the distinction between true data flow and ie low and padding, which eventually lea i ti Sere . e ually leads to the failure in detecting 78 WARNING: xerouPneiasaf ts bok'sSCRIMRAL sit Anyone fond gute ABLE Wace LEGAL proces. Seanad with CamSewrner5 uNiT-1_ Securlly Concepts, Cryptography Concopis and Techniques ats. Explain the caesar cipher, answer! Apa A8(619), al pase . pabet ie, three Caesat cipher is the oldest ofall substitution ciphers which replaces each Jetter of the plaintext with an alphabet ves abend ofthat alphabet, sample Plaintext: Hi, this is Ruhi_ Ciphertext: KL, WKLY LV UXKL ‘The replacement done in the above example uses the following, Plaintext Alphabet: aoobioc od Ciphertext Alphabet . DE F GH 1o3 kK LM NO Plaintext Alphabet mn 0 p gq Ciphertext Alphabet PQ Ro oS T Uo vow x.y z A BC tthe alphabets are assigned with numbers i¢,,0=0, B= 1,€=2yuuy2=25 and ()_TEthe substitution is such that each letter of the alphabet is replaced by a letter i.e, three plices ahead of it, then the substitution algorithm for each letter P in the plaintext substitutes letter C asthe cipher letter as follows. © C=E®) =(P+3) Mod (26) . (i) the substitution is such that each letter is replaced by a letter that is K places ahead of it, then, c (P) = (P+ K) Mod (26) ‘Where, K can be any value from 0 to 25. A decryption. algorithm for Caesar cipher is, P=D(C) (C—K) Mod (26) Q15. Compare substitution ciphers with transposition ciphers. Answer : (Model Papers, 4) | May-16(R13), Q(b)) Substitution Cipher ‘Transposition Cipher ] Substitution cipher substitutes or replaces the coments | 1. [Transposition eipher does not substitute the plainow Ie of the plaintext by other letters, numbers or symbols, (ers with other letters. tcontains monoalphabetic and polyalphabetic substitu | 2, tion ciphers, | contains keyless and keyed transposition ciphers. | Each tier takes its actual position by varying ts identity. | 3. | Bach letier takes its actual id : ity by varying its position. | Example of substitution cipher is Ceaser cipher. 4. | Example of transposition cipher is Rail Fence cipher. . What is steganography? May-19(816), 110) OR" Write a short notes on steganography. ‘Answer : Ps Bec.-17(R13), 0110) eganography is a method in which the sender writes harmless message and th 3c 5 e same Dieppe Seanad in which these ¥en conceals a secret message on the same of stepanogray ogy that was revived by David Kahn (KAHN, 96). The simplest fy Phy isthe one that stime consuming to construct, in which an arrangement or ne Ko nies txt sgewogsy gement of words or leters with harmless text SPECTRUM ALL-IN-ONE JOURNAL FOR ENGINEERING STUDENTS Smad wth Caran6 RUE SCS er (PART-B> ESSAY QUESTIONS WITH SOLUTIONS 1.1 SECURITY CONCEPTS 1.1.1 Introduction Q17. Explain in detall about the basic concepts of computor socurlt ty and attacks. Answer = we 2 c guarding the information system in order to achieve confidentialy, ce rity can be defined as the process of safeguarding t ; a integrity and abit ofthe sceourees present in the computer. These resources include hardware, software, fmware cc Computer security depends upon the following key objectives. (2) Confidemtglty (0) Integrity : . (©) Availabilty. (0) Confidentiality “This concept deals with providing sec privacy ofthe users t further consi () Data Confidentiality “This ensures tha the data belonging to acettain organization is kept private and confidential tis secured from st sorts of unauthorized accesses. curity to,the vital information against unauthorized users and also safeguarding the ‘of two concepts within it. They are, (i) Privacy ‘This ensures control of an individual over the information that it collects. By this, the individual can provide access rights to other users and can also get aware of what information is currently being displayed to which user. () Integrity This concept ensires thatthe received data is exactly similar to the transmitted data by the sender i.e., no insertion, deletion ‘modification or replay occurs during the process of data transmission, However, itis essential that they should be specite and authorized. I also ensures that the data is not non repudiated and is authentic, Integrity is of two types, @ Data Integrity This ensures that updations made to the data are specific and authorized, (il) System Integrity This ensures that the system carry out intended funeti bil ws nas ystem carry out intended functions in undisturbed way and prevents it from unauthorived (©) Availability This concept ensures that proper and safe access is provided to the informati : is provided to the information present insid that he autor wer ae never dened f the atesrequcstl by them. Thee the bane ee eee CIA (Confidentiality, Integrity, Availabilty) triad. Iti represented as all SSCESPEE we sai Availability Figure: Security Requirement Triads WARNING: XeroxPhrctocopying of tis books @ CRIMINAL act. Anyone found gulty is LIABLE to face LEGAL jocmediogs. ce Sosa with Cameronro} ) © @ o) wo @) iy ig. ako depends upon the following ‘Abit from these C1A triad concepts, computer seeutty ‘concepts, sl Authenticity, This concept requires, user v * ave trusted pa n to know th: information that they provide about themselves i vali genuine and intact. ‘Accountability, This concept takes care of the non repudi tite, detecting and preventing intrusions and isolating the faults. 1 ensures that all the security branches ate {raced out by responsible party to ensure that the system becomes reliable, ion of the Denial of Service Threats ‘These threats refuse the destroy the user thre: the machine with fake ‘and eause the machine Provided services of the clients, Is that request for a service, oad requests, overload the memory ulnerable to DNS at Consequences 18 over web results in the n of the norinal execution, in accomplishing ther jobs tion and discontinuation thereby preventing the users on time, MLis-very difficult to avoid denial of service threats and their exist no standard measure, IP Spoofing JP spoofing is an attack where the identity of the source is forged in order to gain unauthorized access to a sys- tem. ‘The message which is sent appears to be as itis sent from a trusted entity, thereby fooling the receiver to accept junk oF malicious Packet Sniffing. Packet sniffing process in which an unauthorized *person/tincker reads the sensitive information for Hegitimate purposes, To avoid this, JAB has made it mandatory to include security serviees such as authentication and eneryption in every IP packet Beneration (i.e.,1PV6 as well as IP¥v4), Eavesdropping ‘When two squrves are being communicated and some “unwanted messages are passed from (he other sources then this mechanism is referred to as eavesdropping, “Internetwork security is both fascinating and ~ complex”. Justify the statement, oe er UNIT-1 Security Concepts, Cryptography Concepts and Tachniques ts 10. | SPECTROM @LLIN-ONE JOURNAL FOR ENGINEERING STODENTS _ Security is never considere: 7 repudiation and integrity. The ate He specify. However, the mecha wig at and implement. jeation. 10% it nis ha eloped in sucha way A security mechanisin has to be developed in sucks wary that cower aed proves secu fort teeta security attacks, Also, approaching the probler i entirely different way may help in identifying, problesns in the mechanism, ‘ echeanisens theeugtt ‘Asarresultof the above reason, the ra ou high certain service ar olfered become logs in description The ned for such procedures iss ripe aspecttofthteas are considered that can strengthen th security mechanisms. When are not considered, is rot needed because 6f the complexities. Once all such security mechanisms are developed, « decision has to be made regarding their usage. For deciding which points in networks require This decision includes both physical al deployment of the mechanism. ‘The mechanisms that are thus developed mostly contain multiple ‘algorithms (or) protocols. They also need Participating entities to hold some critical information (such as creation, distribution and protection) regerding the key used for encryption. As a result of this inclusion of protocols and critical information, the process of mechanism development gets complicated. ‘There is always a constant baitle between the attacker and the developer. The attacker tries to violate the security where as the developer tries to protect it, In such = scenario, the attacker has an edge over the developer 2s ‘single loop hole can lead to breach the security. Bus for” the developer it is necessary to identify and overcome all such loop holes so as to provide perfect security The users as well as the system administrator get benefitted by the security investment. They enjoy the bonefits until failure occurs. Security needs frequent counselling in order to sta up-to-date with today’s changing trends. However, is difficult 16 do.so keeping in mind the short-term overloaded environments of today. it and it to be a part of the design ‘Process. Rather, itis integrated into the system once the Alesign process is eainpleted. It is believed by most of the users and system ‘aiministrators that providing high security will unpose
| vasimation rvtRUDER Figure (4): Modification Examples Modifying the values in a data file or the message contents, making alterations in a program so that it behaves in a different manner. 4,” Fabrication ‘This is an attack on the authenticity of a message in ‘which an unauthorized party adds fake objects into the system. SOURCE sf pesmsstion RETRUDER Figure (5: Fabrication Examples ‘Adding fraudulent messages into the network, inserting additional records toa file. pce rseailignel resante tora Nee Se. G24. Explain in detail about different types of programs that attack computer systems. Answer : Some of different types of programs that allack computer Systems are as flows, ) Views For anawer refer Unit-I, Q25. Gi) Worms Me roms are the software programs thal repli themselves and transmit the elosied copy t0 other computers sing network. They are reproducing programs that execute independently and travel across network connection. These Worms are termed aa network worms. Nature of Worms but the only difference 7 Worma sxe similar 10 virus cr “is tat & worm doesn’t atactr itself to existing program: The + ilfcal tack for a worm is that, it requires a program code 10 be F ecwted on a remote host aystem. Worms propagate by utilizing | ‘vate vulnerabilities available in operating system. 4. i ‘i UNIT-1, Securily Concepts, Cryptography Concepts and Techniquos = Funai virus fae same behaviour as that of comm ‘woems but, the former requires human to perform te oe whereas the lntier independently searches for the system © erloem itsgotions. Network worm can exhibitsitilar pooper {ss computer virus, one it hus been activated te perform destructive action, These worms propagate over network conngetion using nctwork vehicles a follows. (0) E-mail Factlity ‘Worm sends « mi systems. (b) Remote Host Execution Ability Worm independently runs a copy of itself on other system. (9 Remote Login Ability 15 on a remote system by pretending as an commands. is cloned copy to othet il containing Worm log authentic user and replicates itsell us ele phis Network worms have the same of computer virus. They are as follows, 2. ropa 3. Triggering phase 4, Execut Network worm is system was previously infected before repli rmultiprogramming envionment, network worm hides itselfand pretend as a system processor by using other names tat are not detected by users. A system can be prevented from worn attacks by ving regular updates about the patches and upgrades regarding operating System and for other applications. The other ‘way to protect a system from worms is to reduce the services and applications executing on the system. (i) “Trojan Horse A trojan horse can be defined as a computer program containing hidden code which results iii haémful functioning after execution. These programs allow users 10 access information for which they arc not authorized. These programs can be modified when compared to other possible soliware programs. Trojan horses allow the attackers to access functions indirectly. Most of the trojan horse infections occur because the authentic user is trapped to.exeeute an infected malicious program, The important feature of trajan horse is that it has all capabilities and permissions of an authorized user. Trojan horse can either be malicious or non-malicious progeam. The following are'some of the damages mn phase. ble of determining if ing itself. In a sd by trojan horse: {i)__Deleting or overwriting data on the computer. Gi) Cortupting files in myster ii) Deaetivating antivirus sofware prose us Way. iv) Randomly shutting down the system. ‘The best way to detect trojan horse cexceutable files that are ehianged by comparin: all executable files in the system, SPECTRUM @LLIH-OHE JOURNAL FOR ENGINEERING STUDENTS -. i Semmnad with Caner12 oF i CRYPTOGRAPHY AND NETWORK SECURITY UNTU-HYDERABA», | Q25. Define virus. Explain tho nature of viruses. Answer: Mode! Papers, 02(0) Virus A virus isa software program that ereates duplicate copy ‘of'tself and infects another computer without the knowledge of ct In order to duplicate itself, a virus must execute code and ‘write it into the memory. They are usvally transmitted along an ‘email message or downloaded file Nature of Viruses A vitus contains maliciousvharmful code that causes damaye to the system by eliminating important programs, Ueleting necessary files or by reformatting the hard disk. Some ‘oF the viruses are designed only to ereate duplicate copy of themselves but not to eause any damage. Viruses are clasified into two types. They are, (i) Non-resident virus (ii) Resident vies, (© Non-resident Virus “This type of virus searches for other uninfected host programs and infects them. Later, it transfers the control to infected upplication program. (i) Resident Virus ‘These viruses load themselves into the memory during execution and transfers control to the host program. Life Cyele of Virus A virus undergoes the following phases during its lifetime, 1. Dormant phase 2. Propagation phase 3. Triggering phase 4. Bxecution phase, 1, Dormant Phase ‘A vinus is said to be in dormant phase until events such as date, presence of other file etc, allow the program code to be executed. 2. Propagation Phase In this phase, virus creates a duplicate copy of itself and attaches to other programs. Each infected program contains 1 copy of virus which itself enters the eloning phase ‘Triggering Phase Jn this phase, virus activation takes place in order 10 execute the intended action: Execution Phase In this phase, virus executes the Functions that are either harmful or nondestructive. (Q26. Explain the classification of viruses. ; Answer = ! 3 © Viruses are classified into the following types, Boot sector vines 1 2. File virus 3. Macro virus 4. Enerypeed vins 5. Stealth virus 6. Polymorphic virus 7. Metamorphic virus E-mail virus . Parasitic virus 10, Memory-resident virus. Boot Sector Virus is a type of virus which damages the master tox record. It propagates while booting the system Ste: infected disk. File Virus Iisa type of virus that damages only those files are assumed to be executable by the operating syste=., Macro Virus Macro virus is one of the common types of vinss. These viruses cause much damage to system's dats. They ne become a threat because of the following reasons, (Macro virus damages Microsoft Word applications by inserting unecessary words or phrases. Due to this, all hardware and operating system which supports the word document also get affected. Macro virus damages only documents, and large parts of system information which is in the document form instead of program code, Macro virus can be transmitted without an Aifficulty, Encrypted Virus Wis atype of virus which infects in the following way. | Initially, « random encryption key is produced by some part of the virus. Then, encryption is performed on the ‘emaining partof virus. The encrypted key is stored a ‘with the virus and using Stealth Virus is Key, the virus is decrypted ‘This virus is designed in such a way that it hides is! | from being identified by any antivirus software prosra> | Polymorphic Virus | Iisa virus that changes with each infection. It create | duplicate copy of itself where every «: Performs same action. Here, every individual vir differs from one another in their bit pattem. This chans* their bit patterns is achieved using encryption proces | iden i on WARNING: xerowPhotoeaping of tis books & CRIMINAL act Anyone found guity ts LIABLE wo tase LEGAL peeesings Pi ‘ Sona ih CanSerrnar1, Security Concerts, 7 jt Copter 12 “Metamorphic Viruw POY Corts 200 Tehcieaes Metamorphic virus also # also gets ned that, @ Metamorphic virus rewaites so CFY infection in a way sinner to gohyrmery metamorphic virus becomes more thes Po ile Caan se exenasat 8 io virus. Ta Sit suse, of Sis, Email Virws ‘Anemail virus is one of the la : i Me8t develozed harsat ene rie ich 9 rere a ee, a cos a @ E-mail virus is tanemitted t everyone present to pease ee (Ths inser ee tematic ee a 9, Parasitic Virus ° si s orsneee stable Ses jo Memory-resident Virus Resident viruses load themselves into ; eve into the es fe creation infected host program. In this cae, vinss mine on ng en Off. Differentiate between virus and worm, Asswer anesh ete. prengane weil tiesten or ny mod ie ay Viruses Virus is a software program that creaiss @ us is @ ‘creates Guplieate copies of iuelf but requires human meesenton aed across different computers. Itcannot make use of network to create copies. Its major focus is to destroy the filesand system It replicates the files slower than worms. Ii repficaaes the fen 5, | It gets attached to the program code so that it can be 1: dees nee need to gee emacked os pesgrame ee oy executed when the program is opened. ecced, 6, |Ituswally delete and modify files stored inthe memory. 6. | Inumay ds not atlees the Sie sree 028, Discuss in detail about various types of Security attacks with neat iagrams. Answer era Pacers 2 en “Anacks’om the security ofa system or a network can be best desert and providing the required information. The two differene types of smacks that art postitic at. i 1. Passive attacks 2. Active attacks. 1. Passive Attacks . Passive attack refers to the process of monitoring or wireapping of tie cnawing tmeccisice. isto capture the transmitting information. Two possible types of passive amacks xa, oe Palette cgpmet ‘ Uses-1 (Release of message contents (i) Traffic analysis. Release of Message Contents This ype of atack ean be easly understoed incase of sensitive or confidential information waemition. pach 28 ieghemic- convenation, sending of an e-mail message, tc. Here, & opponest is prevented fom learaing or eapnaring the comients of the transmitted information. SPECTRUM ALLIY-OME JOURNAL FOR ENGINEERING STODENTS 3 ‘SoseeRRIRSeRERSR REI Wi tntes or Sead ih CamSerrrar= CRYPTOGRAPHY AND NETWORK SECURITY (INTU-RYDERAGAG, g pene Se OSGi Trattic Analysis FESS Anvnpeodhsedinginmotves fasts whi sche hy EL FS carying owt trattic analysis. This type of passive attack sts ‘more suite mashing technigne fr the intimation SEK LL psing tzansits, is employes an sucha way that $F sppsnentisunabls to evtract the infomation even its SF captured, The common masking technique is encryption ence, passive attacks ane ver ittiout to dtect as there can be a alterations in the transmitted data, Ths it wohl be advantagcous to prevent stich type of attacks father than, Alctocting them after their occurrence 2 Active Attacks Inthistypeofattack, an attacker can alter the information, ‘or sometimes generate fraudulent information ina the network, The four categories ofthe active attacks are as Fallows, oy «i «ity i) Masquerade Replay Modification Denial of service. Masquerade This type of attack occurs when one entity counterfeits to be a different entity. It usually includes the other pes of active attack, Consider an example, where the Sauthentication sequences ean be seized and replayed ater the occurence af a valid authentication sequence thereby allowing an authorized entity with limited privileges to get additional privileges pretending to be an entity that has these benefits. ae iw s Attacker sending messages to User-2 pretending to be User-1 D ser | — Sle tes Taer3] wise 1 SE SEE tretersothe process of passively capnringa panicular LES {7 data unit along with its suceceding retransmission for FSH J soins an authored ete : S ‘Attacker eapruring messages # and sending them later f = = User} > Cater)» f Uren (ily Message Modification It refers to the alteration of a specific portion of an authorized message or delay and reordering of the messages to generate an unauthorized effect, Uh) Servtee Dentat Ainhituts the narmat wsape bythe system or netwack Ha ies acy somne pei to wall Be mgr ant all the messages dest dlestrayeat, Another form of itt the dostictit nt ec rtword, ener hy overasting withthe mesapey e by disabling # to reatuce the wverall pertoomance Ia contrast to passive attacks, active alachs ace hey Alitficult to prevent as they require protection FoF all ay ation facilities, Hence, they must be aecurateh mul revue Q29. Explain the various antivirus approache: Answer: Antivirus Approaches ‘The best way te control threat is to stop a Vins feow centering into the system. This prevention arity of attacks made by Virus, As tis very difis a virus, different approaches are used to reduce vin They are, w (i) Virus detection approach Virus identification approach Gil) Virus removal approach (Virus Detection Approach, When a program is infected, analysis is done to dist and find the location of the Views. ay When a virus is detected, this approach identifies the actual type of virus, which is the main reasoe. fer infection. «| iil) Virus Removal Approach When a virus has been identified, this approach removes all instances of the vitus and restores the info Program to its actual state, Then, vinases fron al systems are detected to halt virus propagation. If detection approach is performed successflly, bt if identification and removal appeoach faiked ty ntentify 2! Femove virus from infected program, then the oaly powuble way is to delete the infected program completely ana! teins a clean backup version of same program Early viruses were just a semple program cose that wert easily detected and removed using simple antivinss softs Program. But advanced virus contains complicated poses code that requires complex antivirus software progras © perform detection and removal Sod wih CanSerrnar ' Zest eee S, \ “ s i n 4 one ee > areeavrevesac os .Tike credit card information and business seerets. ee TST 1 Securit uNIT-1_ Secuily Concepts, Cryptography Concepts and Techniques 15 30, Describe the generations of antivin feneer us software, Generations Of Antivirus Software The differen generations of anv 1, First generation software 2 Second generation sofware 3. Third generation software 4. Fourth generation software. 1. First Generation Software The first generation ay sgecfeslanture scanner. This seanner is used er detecting sins. Though virus contains diffe erent character sequenecs, fave same structure and bit pattern. The disadvaunee scanner is that, itcan detect only those viruses that ay ‘Tre other first generation scanners save the information abot program length and examine it regularly, This is done in onder to check whether any modifications are made t y ations are made to the progra length or not = ius software package are, of this re known, 2, Second Generation Software Ins an sofware is not signature dependen. nsead, the seanners use heuristic rules for déteting possible sins infection. The other approach used in second generation scanners is integrity checking which is done using checksum detection technique, 3. Third Generation Software ‘These programs identify virus based on their action but ston their structures. : 4. Fourth Generation Software They are software packages that contain different types of antivirus methods. These methods are used in conjunction with each other such as scanning activity trap element, access contol eapabili Q31. Discuss about different types of specific attacks. Answer: The following are the diferent types of specific atacks. (i) Spoofing Gi) Phishing (iii), Pharming, (Spoofing Spoofing refers to the misrepresentation of one's identity for fraudulent purpose. Hackers attack individuals or organizations using fake e-mail addresses or domain names that resemble very closely to the actual e-mail addresses or domain ‘ames, For example, jhe bogus domain name of iici.com (ind) istegistered fora legitimate site, icici,com. The boyus site copies ‘the legitimate site’s text and graphics to resemble the legal site. Next, it sends attractive messages inducing users to give U Personal information, The innocent targets that assume the Message to be from the IP address of a trusted system reveal ‘heir private information. Thus, with such unauthorized aceess, hackers gain valuable information of individuals or corporate (i) Phishing Phishing pronounced as fishin ‘hich victims sufferanatack where they are redirected 10 ‘ther website the moment they click on the link, Such links a fake and victims generally come across them while browsing internet or through a sent e-mail inthe mailbox. Some of the websites by which users get attracted are as Follows, , Claim your lucky draw by clicking on the link below, winwelaimdraw.com 4 “Security breach’, itis thereby inform that due tosome scourty reasons customers are requested to provide their account detuils by clicking on the link below, wwvbanking.com {As shown in the above examples, the moment one click onthe above websites, they are redirected to some fake website ‘hich resembles with the original bank website, Phishing attacks are usually exceuted by using URL's similar tothe original websites URL'S. Therefore, when the user enter its crucial information onthe fake website then the attacker sgnins access to the users sensitive information and misuses it. ‘Types of Phishing (a) Spear-phishing emails {b) Web forgery * © Avalanche phishing. (2) Spear-phishing Emai Spear phishing e-mail is a highly recognized phishing technique, where the emails copy the messages from authoritative source which could be financial institution, 2 communications company or any famous entity associated with a reputed brand. Basically, all the phishing techniques are exhibited in social engineering. URLLink manipulation filter evasion ie, images are used to hide malicious links and website forgery. Web Forgery Web forgery is also a kind of phishing where in an identity the occurs when a malicious website pretends tobea legitimate one, soas toacquire sceret information Avalanche Phishing ‘The Avalanche phishing is a criminel act which is considered as the most sophisticated and damaging across the internet, lis productive in mass-production system while setting up phishing sites and malware development particularly for automating identity theft. 10 also encourages unauthorized transactions from consumer bank accounts. It is solely Yesponsible for increase in phishing attacks across the internet reported bby Anti-phishing working Group (APWG), Pharming Wis another important phishing technique wherein DNS tables are contaminated such that vitim’saddress (ivsow.paypal ‘com) points to some phishing site. So, each time the user clicks the site, it navigates him to the phishing site. However, if the yg refers to a process in ed to some a fo © iy user performs URL checking, it prevents DNS mapping SPECTRUM ALLIN-ONE JOURNAL FOR ENGINEERING STUDENTS: : Sod ih CamSerrrar16 CRYPTOGRAPHY AND NETWORK SECURITY [JNTU-HYDERABAD, 032, Doseribe man-n-the-middie attack and compare ‘with ARP attack. Westone 4810), O%D} on Discuss thy “man-in-tho-middis” attack. (efor Only Tophe: Man-in-the-Middle (MITM) Attacks) Answers ‘Auth 15), OMe) Mai Ahe- Middle (METM) Attack MITA are the mont effestive lypes of attacks often woe Alon ih the encrypted protean hijcking and S51} and S51. connection types Consider an example of user trying, wo establith a ‘connection Vian SSL enabled ste Here the hey is inerehanged ‘with the SSI. server and its centificate ix compared ith the certificate sted inthe web browsers rusted 18 certification authority store. Ifthe desited certificate is found in the cemifiation shorty store wath no limitations or restrictions, then nu warning messaze appears un the client side. However, 4 venion key i provided for encrypting the eommunieation that staking place between the SSL-enabled site and the client system, Initially, at the time oF MSFT attack the elent ia not really connected tothe SS1.site. Rather, «hijacker provides fake rodents and replies using the clients information to the SSL site. Hence, he hijacker establishes a connection with the SSL. server us a representative of the client system and displays all the information anit in either of th two directions ayain, ‘ri this, hijacker can choore any portion ofthe information Comparlon with ARP Attack AWD attack is a type of MITM attack, These attacks refers Wo the altacks performed on the ongoing packets across the snachine. The objective of these type of attacks ix to alter the ARI tables un the target machine. The main function of the ARP able isto contiol the MAC-addrers to IP-address mapping on each individual machine, Hence, ARP iva dynamic protocol which is used to assign the MAC addresses to the newly added machines into 3 network. Itisalso used to obtain the new MAC. addresses foi the existing, machines asa result of which all the machines are dynamically updated within a short interval of time. The drawback of this protocol is that no authentication is provided by it. Whena MAC address belonging to a specific IP address is browdeavted, the attacker acts asa real machine and provides the requested MAC address, During the process of traffic forwarding, no difference in the requested address is noticed At somne specific point, such as traversing a packet across LLAN, © theve differences are noted and handled. Anavailable too! for pertontning an ARP attack i grat-arp © WARHING: Zorox/Protocapying ofthis back isa CRAANAL act. Anyone foures gutty Is LIABLE to face LEGAL proceedings ' 1.1.5. Security Services, Security Mechanism, Q33. Write a short notes on throats, Answer + ‘Threats A threat refers to the cayability of violating the secur |) pom the occustence of an event, action of a circumstance. jf affects the network vecurity and causes damaze to it. Inston, threat isan expected danger that may attain vuleerability. Thy ponsible threats to network security are as follows, () Insecure Network Architecture A network which is rot configured in a proper mance oceans an easier entry point for intruders. Keeping a trust-hased local network open to an insecure internet ultimately causes someone to make use of this “opportunity to enter the network in an unauthorized ay (ii) Broadcast Networks Many system administrators fail to analyze the significance of networking hardware in providing the feature of security. The hardware devices such as hubs and routers are dependent on the broadcast or non-svitched principles. This means. once the data is ansmitted ta recipient over a network, the conrecting device i¢., a hub or a router broadcasts the data packets Aill the reception of a node remains the receiver. Apart fom this, it causes a vulnerable effect on the Adres Kesnlution Protocol (ARP) and Media Access Control (MAC) addressin, Centralized Servers Gi) ‘The use of centralized computing is another threat to network security. This can be reduced by integrating all the services into a single server rather than distributing on ‘muhiple server configurations. This reduces the overall ‘cost and makes the task of network management easict But the problem with this approach is that, it leads network failure, if some malfunctioning occurs in the Centralized server. In such situations, central server acts 4 an entry point for the unauthorized users to enter a4 disrupt its functioning. (iy) No Firewall ‘The most common error often made by the administatoss and home-users is their assumption about the network security and hence they relinquishes the implementatioz of a firewall or network packet filtering service. TRE Firewall installation in a stand-alone ot a gatews is important for segmenting internal and external network. It also helps in making the task of finding te network's external IP address for the crackers, e2sict Hence, an intruder enters into the network and acts 3 4 proxy. This problem can be prevented by employing firewalls that perform the task of packet filtering. pot forwarding and network address translation. Impropet firewall implementation makes the network completely vulnerable. Sod ih CamSerrnarposers Different types of controls that are. Available to users ace, Fo. _ 3. Physical control, Software control refers to the contr grorams must be developed and maintained in such ¢ way that they ensure desired security. Several ; Program contols provi computer securities, Some of them ate as falloon (@_Imernal program controls i) Network and operating system controls i) Independent controls (iv) Development controls. (Internal Program Controls These controls are some parts of provide security restrictions like database program, (i) Network/Operating System Controls ‘These ate the restrictions applied by the network or operating system inorder to protect one user from all other users, Independent Control Programs These are the application programs like intrusion detection liabilities, virus scanning, password checker et. which protect from several type of vulnerabilities, (iv) Development Controts ‘These are the quality standards used while developing the program during the processes like designing, coding, {esting and maintaining, These standards help to prevent software defects to become as exploitable vulnerabilities. 2. Mardware Control Software control f the program which sceess limitation in a iy Mardwvare control refers to the control over hardware devices that has been developed to help in providing computer security. Some of these controls are as follows, () Firewalls (4) Instnw t iiy n detection system. Implementations of encryption through smart card or hardware, Access limitation through locks or cables. (¥) Devices that can verify or identify the user. (vi) Circuit boards controlling the-access to storage medi . Physical Control (iv) B B -___ Physical controls are snost easiest, effective and least _O'Petsive, Indoor locks, backup copies of important software 794 dara and physical site planning are some of the physical canto, ert Paper ie) Describe pervasive and specific security mechanisms in detail. (Refer Only Topics: Pervarive Security Mechanisms. Specific Security echanisms) Answer : Dect, C2) Security Architecture The security manager det the ways of defining security requirements in order to effectively determine various needs pertaining to any organizations secuity. Moreover they ate used to assess various security products, policies, end for o he zpprcaches for satisfying the seoutity requirements. Some of the sysiematic approaches such 2s ITU-T" recommendation X21) and security architecture for OSI, have been developed for this poxpene. The OSI security exchitecrsre helps the security mene. in coordinating various organizational tasks thereby ensuti ‘security. Most of the computer vendors have adopted imernationally standardized sxchitecture of developing $00 features for their products and services. The OS! security architecture is mainly concerned with the following three For answer refer Unit-I Q21. 7 sodekct, 2. Securty Mechanisms tok it denged ode Kets Seng BO recetex TOM & The security mechani AAS Sid re Coser into to types. They ae as follows, ec tpatt (9) Themechanisms that are execcted in a particular protoco! layer. ‘The mechanisms that are not specific to any protecol layer. (i) X.800 also differentiates between reversible and irreversible encipher techniques. A reversible encipher technique refers to an encryption algorithm that encrypts and decrypts the data whereas ireversible encipher mechanism involves the application of hash algorithms and MAC which are often applied jn digital signatures and message authentication applications Security mechanisns { i ‘Specific Pervasive securey securty | mechanisms mecharisas Figure: Classification ef Security Mechanism SPECTRUM ALLIN-ONE JOURNAL FOR ENGINEERING STUDENTS _ Sosa wth CamSerrnar18 CRYPTOGRAPHY AND NETWORK SECURITY [JNTU-HYDERABAg)| - 1 (a) Specific Security Mechanisms. + * ti | ices. Some gf “These type of security mechanisms must-be includ in the protocol layer for providing OSI sei the specific security mechanisms are as follows, ; ()—_Encipherment: refers to the process of applying mathematical algorithms for converting data into form thal is not easily access ‘This depends on the applied algorthin and the encryption keys. | Gi) Digital Signature : “The appended data ora eryplographic transformatign applied fo any data unit must preserve the integrity ofthe data ‘prevents it from any unauthorized access. i (il) Access Control 5 . Itrefersto a variety of techniques that are usually employed for enforcing access perm Im resource, (vy Data Integrity | Itrofers to a variety of techniques that ensure the integrity of dats, () Authentieati \n Exchange 11s a mechanism of ensuring the idéntity of either a sender or a reeciver by exchanging information between them, (vi) Traffie Padding . ‘The process of inserting bits into a data stream-to thwart traffic analysis attempts. (il) Routing Control I seleets a route that is assumed to besa for transmiting certain amount of data and immediately changes the route one a bieach insecurity is detected. (vii). Notarization Itefers to the involvement of a trusted third party for assuring some specifie properties of a data exchange. (©) Pervasive Scourity Mechanisms ‘Theb'ar ie meehinisms that are not implemented in any protocol Iner. The various pervasive security mechanisms as follow, 6) ~ Trusted Fun ality ‘ a is something which is considered:to be correct in rel i) Security Label jon to some criteria, ‘The bounding value of a resource which specifics the seeurity mtributes associated with that resource, (ii) Bvent Detection Iisa process of detecting all the events related to network security. (iv) Security Audit Trail | - The process of collecting data and using it to enable aseet reviewing and examining various records and act (v) Security Recovery It deals with the requests made by various mechanisms such as event hand and takes certain recovery actions. indling: and lunctions related to network management 3, Security Attacks For answer refer United, Q28. WARNING: XerouPhotbcopying tis bok sa CRIMINAL act. Anyone found gully is IASLE to face LEGAL procmmings Semiad mith CanSerrnar19 | UNIT-7_ Security Concepts, Cryptography Concepis and Tachiniques 38. Give the relationship betwoon security sorvices and security mechanism. answer t Sceurlty Services Securit - Mech Hetty | Data Origin | Access] Contte-| teat Flow | Date | Nem | ayautity Authentication | Authentication | Control | atiality | Confidentalty | Integrity | Repudiation fEncipherment | Yes Yes No | Yes ves Yes No No Digital signature Yes ‘Yes No ‘No No. Yes Yes No ‘Access control | _No No Yes | No No No No No Data integrity No No Ne_|_No No Yes Yes Yeu ‘Authentication | - N oa exchange fes No No |. No No No 0 Traficpadding | No No No [No Yes No No No Routingcontrol| No” No__[- No | Yes Ves No. No No No No No_ [No No No. Yes No 37. Whats the relation between security mechanisms and attacks? Explain. Answer: ‘Security Attacks Security Mechanisms | Release or | avame Modification ] Dental of nn Masquerade | Replay : essage | Analysts ofMessage | Service Encipherment Yes No No No No No igital Signature No No Yea Yes Yes No [Access Control Yes Yes Yes Yes No Yeu Data Integrity No No No Yes Yes No [Authentication Exchange Yes No Yes ves_| No Yes Traffic Padding No Yes No No No "No Routing Controt Yes Yes No No No Yes . _ Notarization No No Yet Yes Yes No 1.1.6 A Madel for Network Security 38. Describe the model for network security with neat sketch, Dec.10(R48), 02/4) OR Give a model for Natwork Security with neat diagram, May-17(813),02(0) OR * Explain the modal of network security, (Model Papers, 3a) | May-164R13), 03(a)) Answer : Network Security Model Generally, the data which is in the form of a stream or a block can be transmitted over netwotk between the Iwo fe geancating partes. The entity which is responsible for transmitting the data is called a sender and the entity which rcelven the data (from the sender) is called a receiver. Both the parties must have certain level Of coordination between them in order eanchange the data Ifthe sender and receiver ae liked through connection-oriented means then they tun we connections ‘tiented protocol like TCP/P for transmitting the data, During the process of data transmission, some unauthorized interruption ling security to the transmitting data. The model for the network security is SPECTRUM ALLIM-ONE JOURNAL FOR ENGINEERING STUDENTS. Seanad wih CamSeorrarx 20 (CRYPTOGRAPHY AND NETWORK SECURITY, {UNTU-HYDERABAD, ;
ui Polyalphabetic ciphers. ~ 1. Caesar Ciphers Caesar eipher is the oldest ofall substitution ciphers which replaces each letter of the plaintext with an alphabet ix. tony places ahead of that alphabet. Example t Plaintext: Hi Ciphertext: KL, WKLV LV UXKL_ ‘The replacement done in the above example uses the following, Plaintext Alphabet oh a b c© d e F g hei j kU letters, numbers or symbols, iphers ~> yee e is is Ruhi : Ciphertext Alphabet D E F GH I 3 K LM NO » Plaintext Alphabet ats TP GRR PO oe weet yong Ciphertext Alphabet P Q R Ss T U v Ww x ¥ Zz A B c If the alphabets are assigned with numbers i.e... a= 0, b= 1, c= 2,.. = 25 and, i) Ifthe substitution is cacl abet is rey , “4 ns button sli ot ther Pin he amon aha he ee ees tea CHEW) p = (P+ 3) Mod (26) Gi) ithe substitution is such that each CHE) =(P + K) Mod (26) Where, K can be any value from 0 to 2: P= DO) = (C~ K) Mod (26) letter is replaced by a letter that is & places ahead of it, then, 5. A decryption algorithm for Caesar cipher is, En = CAA) trod 6 Disadvantages 4 Anattacker can easily decrypt the ciphertext by simply tryi + trying all the 25 possib| 2% ‘The language of the plaintext can be recognized easily. * ON, encryption and decryption alo rthUNTT-T Seourty Consents, Coptog Monealphabetic Ciphers ee SR Se tes a ork, 20hy Concerts end Techriques 28 = = of each of the plsintext eters 19 each of ne E aoe ‘Paabetic ciphers ape midre secufe, a: each letter of the cipheriend can be eny permutation Se cha : 3 cpmnes ter leading 0 26! or pester han 4 10% poste hs Thar eimiatog *ste-Force Techs Howeven ifthe on Seer eo ratenalystisaware ofthe nature of the plain he cen then easly findot Foc this user mus frst erties ofthe lnguage, Ou the frequency of the lewers end then compare it with 2 stendard frequency disvibution for OSUZPWXSPTZPIMDSFOCDTUAPCX ‘The frequency of ‘8 lecer must be counted and then compared with the selative frequendy table, | Alphabet Count [Alphabet] = | Count [Alphabet]: | Count | F287 2 W s 3 x u 2 e Lig 2 P : 4 M sumetical cipher symbols such as 17, 74, 34, 5 5 16 and 29. Each of these homophones ean be substiused by performing sotation or they can be subsituted randomly. ‘The single-lener frequency information is completely eliminated, if the number of symbols assigned to each leer an relative frequency are proportional to each other. Disadvantages @ Application of homophones makes eryplanalysis stright forward, as each letter in the pli the ciphertent. (i) Ciphertemt also consists of multiple letter pattems. Playfair Ciphers Playfair cipher isa multiple-letter encryption cipher. I! maps the diagsems inthe plaintext to diagrams in the ips ‘basis of the playfair algorithm is the,use of a keyword for constructing a 5 » 5 matrix of letters. This m by first filling in the letters of the keyword from left to sight and fom top to bottom of the matrix. The remainder of the ‘matrix is then filled ~ith the remaining letters in the alphabetic order, Example Keyword : Security s[eleluls] tirly ape 5 i es ce 5 viw[x}@ The encryption of plaintext takes two letters ata time based on the following rules. (2) Ifa pair of levers has the same letter repeating itself, then bese letters ate sepatated by placing a filing later. sock ash. A * Example “the Keyword ‘Cartoon! will be treated as Ca rt 0x 00. SPECTRUM ALLIN-ONE JOURNAL FOR ENGINEERING STUDEHTS Semnad wth CamSerrnar26 CRYPTOGRAPHY AND NETWORK SECURITY LUNTU-HYDERABAg) (b) Each of the plaintext letters that are in the s row of the matrix are replaced by a fetier to their right, starting from first clement in a row and circularly following till the ast. For example, UR is encrypted as RS. (©) Bach of the plaintext leters that are in the same ‘column are replaced by the Teter bencathit, starting from the top element of the row dnd circularly following til the last For example, SQ is encrypted as IS, (@ _ Else, Gach of the plaintext letters are replaced by a letter that belongs fo its own row and in a column in which the other plaintext leter is present, For example, TO becomes AM and DU becomes SH oS. Playftiris an advanced form of monoalphabetic ciphers. It uses 26 letters where she number of diagrams thal can be formed ate 26 * 26, Thus, identifying individual diagram is difficult. Use of playfair cipher makes frequency analysis of oifferent leters more complex. ‘Though, the seurity level is high with playfair ciphers, it is relatively casy to break this tipher because it sil keeps the structure of the plaintext language together, Hill Ciphers tis also. multiletter encryption cipher which involves, substitution of tm’ ciphertext letters for ‘nr successive plaintext letters. Here, each ofthe characters are assigned witha numerical value (a= 0, b= 1, e=2, d= 25). If 3, the system ean be defined as, C= Ky Prt Kin Pa + Ky Pi) Mod (26) GFK, P,+Ky P, + Ky P,) Mod 26) GF Ky P+ Ky P+ Ky P,) Mod (26) ‘The above statements can be represented as matrices and column vectors. =” Gi). (Ku Ka &a)(% 62/4) Kar a Kn | | Moa 26 o Ky Kn Koy Thus, C= KP Mod 26 Where, a C= Column vectors of length 3 P= Column vectors of lengtt 3 K= 33 encryption key matrix, For the deeryption process, inverse of mais Ky ic. K°! is required. It canbe defined bythe equation, KK ‘Here, 7 an identity matrix that contains only 0's and 1's as its elements, having 1's on its diagonal from top Jefl to botiom right and rest ofthe elements in the matrix “ane 0's. = WARNING: xeroxPhotocopyig ofthis book it @ CRIMINAL act. Anyone found gut is LIABLE to face LEGAL proceadings - a To recover plaintext fom a ciphecext, the main py must be applied tothe ciphertext, Thus, the Hil ein can be expressed as, C=B, (0) = KP Mot 26 P=D,(C)= KC Mod 26 =KKP =2P =P (@ _Itean perfectly hide single-leter frequencies, Gi) Use of 3» 3 Mill ciphers can perfectly hide both iy single-leter and two-letter frequeney information (ii) 11s strong enough against the attacks made ony on the ciphertext. Disadvantage It ean be easily broken, if the atlack is made through known plaintext. . Polyalphabetie Ciphers Polyalphabetic ciphers are the improved form of mona ‘habetie ciphers, thal use different monoalphabetic cipher for differenCleters in the plaintext. ‘The common features of this technique are, 1. Usinga related set of monoalphabetic substitutes res. 2, Fora given transformation, the specific rule te used! is determined by the key. ‘The simplest algorithm that contains the above feature is Ieigner cipher. Here, the set of monoalphabetic rule {hat are related to each other are 26 Caesar ciphers ths) have the shifls from 0 trough 25. Each of the 26 ciphss ane placed horizontally with their key letter to its le. Te) normal plaintext letters are placed on the top. The process} proceeds as follows, f risa key letter and h is plaintext fetter, th} the intersection of row rand column his y and) the corresponding ciphertext letter. } % Gheryption of a message requires a key which # as longas the message, The sirength of ences depends on the type oF key used. Consider the lowing cases, s I (a) ihe key is a “keyword? that is repeated, it eo! Fysponds to the length of the message, Example { i nord = Secured and, Plaines Do ot eval The Key eres the key corresponds to, k Securedsecuredsecu Pliintext: Donotrevealseerets. | Semad mith CanSernarLTR MELAS ANS ROOT ET yet ecumity Conoopte, Cryptogt User Wetitive hey wontavthe howl aliiee a Cones ph jst wiles Kes cipher: Se, at analyst eat ake w ations ot the ener es Kes wvota lent atte message That Has 6 ments ot) avvaly ine one ‘oman ftctos ia the alisplaces ious sexqtetces AH) Mthe “heysountis tttowsel hy the pinteat letters Mwonkeetocorysponnd ty the length aif the meses Examnypte Seeured Donotreven| Donotreveatsecrets Using | this, the periodic nature ofthe Aeyword ean beclintinated, This apprasich is alsa reletred tone Autokey system, But use of this key does not make the ciphertext secure as the key rath share the same frequency’ fers and thus bas a stati (©) Akeyisused, any statisti such that the plaintext does not have HU eelationship to it Team be expressed as, Where, P= binary digit of plaintext of ciphertext ® = Exclusive-OR (NOR) operation, Thus, XORing both the plaintext and the key produces ciphertext, In order to produce plaintext, the dceryption Hrocess requires, XORing of ciphertext and the key, Q4, How would you test a piece of cipher text to determine quickly if it was likely the result of a simple substitution? Explain. Answer May-194R16), 02(0) The cipher text generated by the simple substitution sipher can be casily cracked by using paper and pen. The ‘number of keys possible for a simple substitution cipher is 2". In comparison, Caesar cipher offers only 25 keys and Affine éipher offers 311 keys. Among all these keys, only good keys ‘Bt searched and tested. To quickly identify the message encrypted using simple substitution, english letter frequency count can be used. Ac- ‘cording to the frequency count of english letter, E is the most frequently used letter. Examining the most frequently used letter in the cipber text, it can assumed that it is the letter €. Let the (hird leticr is assumed as ¢. then the first three letters are likely to be the’ as it is most commonly used article. With similar as Sumptions, the plaintext can be obtained quickly. WV Conoeptn and Tactniquers nailer way of obtaining plainte ce testo hom simple anbstitution is the use af hill-ebimbing ‘ahyoutte, Uo this ahuonit Nish toxt known a be qteater Uh cebintacte sine dhe simanity a a pleco text 1 Bn linens by determined. The fitness value ir iia Ft text ana toe cone i : ‘ eis obtained jis tost statistics andl then ealeulating the pr text Is obtained from siznilar distribution, Following: ate the steps involved in hill-ctimbing. algo- uithi, Step tially, « eanidom key ix generated which is known as parent key. This key is used for converting the cipher text to plain text, Hased on the result, rating is given and, finally, the results ate stored, Inthe next step, a slightly different key is used to obtain its fitness, Step Whe fitness value is 4 the new key with ald one as patent Step: Repeat the algorithm until the fitness gets improved til the Last 1000 iterations, Q45. Consider tho following: Plaintoxt: “PROTOCOL” Socret koy: “NETWORK” What Is the corresponding cipher text using play fair clphor method? Answer + May-160R12), C2ia) Given that, Plain text “PROTOCOL” Secret key "NETWORK™ Using playfair eiptzs, a 5+ 5 matrix of letter is con structed by filling in the lettery of key from left to tight and top tw bottom of the matrix follows, SPT Re ]A [ac fe fe fn fu tate ols ulytx [viz This is the required matrix of secret key, The encryption of plain text takes two letters ata time, Plain text: PROTOCOL PR OT OC OL SPECTRUM @LLIN-ONE JOURNAL FOR ENGINEERING STUDENTS Sod wth CanSerrrarCRYPTOGRAPHY AND NETWORK SECURITY [JNTU-HYDER Ag A, 28 ° ince, PR belongs to different row and column, P, Rare | 2 Flow replaced by LA. Ate ats fees a Me il ag 4 OT belongeto samerow, tothe ciphertext for Tie sw. | the transposition cipher can he easily found ry placing ye (Teh rsa ili ext D'S ciphertext in a matrix and arranging. the column peitions 4 OC belongs to same column, So according to playfair Ficiainealvehmneieen Peinide aia eras ier sse letters are: “d by the yeath it, a 7 Cie be ey thes beers ue planet hye etter performing transpositions again and again. Henee, the resuting (OC is replaced with CI oF CH Ciphertex! cannot be eryptanalysed. “© OL-belongs to different row and different column, there Applying double transposition to the above example fore OL is replaced with Fs be DR BT ‘The corresponding cipher text of “PROTOCOL” with lege a. .8 a fale oo ° : is. LA NW CI NS" secret hey "NETWORK" is, "LA NW CL fen We fe s d g i ca 1.2.3. Transposition Techniques Q46, Give an oxamplo to explain the concept of transposition ciphers in detail. o9«-17(n13),a3, OR Writo any three transposition ciphers with oxamplos. Answer: De. 4R IE), 038) ‘Transposition Techniques In transposition technique, the plaintext leters are not substituted with some ciphertext letters, Instead, the plaintext letters themselves are used in shuffled form to generate ciphertex ‘The complexity of a ciphertext depends on the ions applied on Railfence Technique One of the transposition techniques used isthe railfence technique. Here, the shulfling is performed in such a way that the plaintext is written down along the sequenced diagonals and is read along the sequenced rows Example Plaintext = Do not reveal secrets shuffling through railfence technique. Dyn.teve,le.r,t, ‘Then, ciphertext = Dateelertoorvasces ‘A scheme that produces more complex ciphertext is, Output : neadhgoMaoeCaiiCad Visualizing Donble Transponition Techniqwe Based on Ke, Name the letters of the plaintext with numbers thea are 27 letters in the plaintext then specify their ponition. If the letter sequence can be shown ax, Oo) 02 3S Cn a Bo 1 1S 16 IT a 19 2 2 2 Bw 2% 2% 27 Let, the key be 351624 Then, the first transposition produces, Key: 3 $ 1 6 2 4 Input: Ol 2S 7 0% 1 on 2 13 1k IS 16 IT 19 2m 2 22 23 wm 2% 2% 21. Output: 03,09 1521 27 05 11 172301 07 15, 19.25 06 12 18.24 02.08 14.20.26 04 10 1622 ‘Then, the second transposition produces, writing a message in a rectangle along the rows and reading Key: 3 5 1 6 2 4 the message along the columns, but the order of the columns | faput: 93 09S as is shuffled, The key to the algorithm must provide the order of | : the columns. W 7 23 or 3 Example 9° % 06 «12 IR Plaintext = Mission Code Changed Ge he. OF Let the key be, 36254 1 es Key: sar ky. if Output: 15:23 06 14 22.27 67 18 26 03 11 19 02 10 g Plaintext: = M i - a ‘i 05 13 24 04 09 17 25 04 16 21 OL 1220 é 5 ee ee As the resultant ciphertext has a legs structure i ee permutation, the cryptanalysis hecomes more difficult. is Be ea eid 4. Vernam Cipher <<. Ciphertext : oCdsonMnhicesdgiCa For answer refes Unie, Q48C). 5 a WARNING: Xerox/Photocopying ofthis book is a CRIMINAL act, Anyone found gully fs LABLE to tao LEGAL proceeings. Sosa wih CamSerrnarf Q47. Write short notes on one-time pad methods. ‘ = ‘one Time Pad (OTP) once. If One-Time Pads (OTP) are tists of random numbers hi & ed. They are used only once. I lists of random numbers using which the messages are encryp ¢ : i soe random numbers are used in the OTP, then its length will become longer than the message, thereby making the original Key igecoverable. Thus, the message will also become irrecoverable. Based on this, the one-time pads are considered to be the on! ‘beoretically unbreakable encryption systems, ‘Thus, OTPS are used to enerypt short messages that requite very high security. Advantages of OTP 1, OTPsare the oaly theoretically unbreakable encryption systems, OTPs provide high security. Disadvantages of OTP 1, The pads should be truly random, otherwise the pattems willbe 2 The use of OTPs is avoided in high-traffic environments and can be compromised using frequency analysis. 3. __OTPs can be used only once. Its multiple use makes it easy to analyze and break it. - 948. Discuss in brief about the following transposition techniques, 2 3 () Vernam cipher (ii) Running key cipher-book cipher. Answer : © Vernam Cipher ‘Vernam cipher isa type of one-time pad that includes along sequence of non-repeating random numbers which are combined ‘with plaintext, This encryption technique uses a teletype machine with long punched paper tap consisting of unique random numbers. ‘These random numbers are combined with the characters typed into the teletype machine. Vernam cipher is considered as non vulperable algorithm because the patter of the key cannot be easily identified by the atackers‘interceptors. 7 EN DECRYPTION Semad uth CanSerrnarCRYPTOGRAPHY AND NETWORK SECURITY (NTU-HYDERABAy, 30 2 tand the working of vernam cipher. Sa esate heck ogenalcrt tet ton 9912658 eh RES TPSSHEU Yume Suppose the alphabetic letters ate equivalent 0 t0 25 respectively ae k ‘ered into numeric equivalents by the sender, message letters are converted into > MLAINTIAT HO WARE ¥ : . NUMERIC 7 «14 2200 17 4 2 2 EQUIVALENT ” peandoee 2-dight ounbers ae pener on ster codes and this same key is also used in decoding generated to combine with letter codes an i ° Random Number 23.17 0 16 25 19:12:13 Step 3 The letter codes and random numbers are added. 74 017 4 24 14 20 NUMERIC EQUIVALENT RANDOM NUMBER 23° 17016 SUM 303122 16 42 23 28 16 33 Step Perform mod2 on resultant sum suM 30091 Maite 4. 5 zi 1 2013 : Mod26 numbers are converted inte alphabetic equivalents Mod36 4 S$ 22 16 16 2325 16 7 per EF W QQ X Qu a TEXT ¥ Therefore the message HO WAR EY OU is encented as ERFWQOXzZzQH (i) Ranning Key Cipher/Book Cipher rete key cipher also called book cipher i similar to the vemam cipher principle. In this technique, a part.of text ag key cipt ique, a pi sre grad from a book and is used for generating cipher text, This par (or portion) of text acts asa one-tines pad which is ate 2uide to the input text message in the same way as that ofthe working of aene-time pac. 1.2.4 Encryption and Decryption * 249. Explain in detail the process of encryption and decryption. Answer : Process of Encryption and Decryption icthod of converting plaintext into ciphertext. Using this method, Security of data can be achieved " Iie can be decrypted ifthe user has capability of accessing the secret, key or password. In this context, area Pied data is referred toas plaintext whereas encrypted data is referred te wn Ciphertext. Decryption is the reverse process of encryption, that is, converting a ciphertext into plain : Piagramatic representation of eneryption and decryption process is shown below, Sender-Reeipient ' Sender-Recipient Shared secret-key Shared secret-key kK P=DIK,C] }—-[Decnption Algorithm |} Phintext ‘Ouiput Figure: Symmetric Cipher Model WARNING: Xerox/Photocopying ofthis book fsa. ‘CRIMINAL act. Anyone found Gully is LIABLEdo face LEGAL proceedings. f Sosa wih CamSerrrarTh eps! ‘ved in encryption anu deryption pes steptt Initially a plain text o an dviginal mess cneryped and is fa hua ead input to eiveryption that i uble form is proy Example: A text imaye. Uocument, an ex ‘uuble file or an orm plainte performing I then tran unintelligible form by ns and substitu step A seeret key is randomly selected that acts to both the eneryption and Therefore, both th as deeryption ‘algorithms, "nd and receiver mist share the same Key and make sure that iti put cured, in order to Ages. The encryption ations and substitutions spending on the key. Step 4: Now, the plain texts converted into a scrambled version called cipher text that is not in a human-readable forms, The ciphertext produced by the encryption algorithms depends on the secret-key and the plaintext. The eneryption algorithm can produce different ciphertext for the same plaintext by using different sccret-keys. Steps: Finally, a reversed form of eneryption algorithm i.e, decryption is performed. It takes the cipherteat (ie. the encrypted data) as input and decrypts it using the same ey that was used by the eneryption algorithm in order 10 produce the plaintext (i¢., the original message o data) restric intruders from reading mess algorithm performs the transfor on the plaintext accordingly, de 1.2.5 Symmetric and Asymmetric Key Cryptography Q50. Explain symmetric and asymmetric key cryp- tography. : Answer : (Mode! Papert, a3(b) | Apri-ta(Rs}), 02} ‘Symmetric Key Cryptography For answer refer Unitel, Q51 \Asymmetrie Key Crypt key cryptography? Discuss its advantages and limitations. ‘ [Answer May-17IR13), a3(a) [Ssmmetric Key Cryptograp ‘The symme JO! crypto, py. ic hey exyplography isthe ost earliest form raphy. IV is also referred tas secret hey etyplonie The encryption and decryption is done usin only one hey eilied secret key. Mt should be kept secret and shai eon users must be done by keeping the key to th Cun bequently, the encrypted data can only he decrypied us he same secret key used while encryptivn, a Ee TT 31 uNIT-1_Seourity Concepts, Cryptography Concepts and Techniques plography Th algrthns based on syne SE my operates a very high sev which makes it appropri Df nour of tener, On the oe ml me 1e key is highly importa ey cryploare without being accessed by a third party. In essence, ba a. parties intended to communicate each other can ae Lo il, by exchanging the seeret information long before the co mencement of the commun s ausagee upon the key whete exchange of key mast he done by a method, different from regular transmission of k« his. incthod is referred to as “out-of-band” messaging. Further, the algorithm also’ suffers frog the problem of scalability, The sealabilty eonforms wo the explosion between the total umber of keys necessary with the increasing number of come ‘munieating pairs if'every single pair demands an individual key To illustrate this, consider the secure communication be- {wveen two parties using symmetric key eryptography. Basically, the total number of keys required is only one. The variation in number of keys occur with the number of people involved in the communication. That is, three members require three keys, four members in the communication requires six ke ‘sequently, for five members ten pairs of keys. This ‘as explosion which continues radically. Similarly, for 1000 uses the total number of separate keys required would be 49,950. however could be tedious task in terms of managing th ‘The entire calculation can be simplified by devis nur) ga fo! Another concefn could be availability of tess n of information sceurity services. Some of the core infor secuity services offered here are confidentiality, eta ‘and authentication, Public key T Private T — si Tener Denim HS Insecured Channel - Sing secret bey (unknown) DeaF Sender Secured Chinas Resse Figure: Secret Key Cryptography {or} ‘Symmetric Key Cryptography 1 Aolfers high speed. 2. Ieissecure 3 W can he easily understood 9 nd can be considered as Aircucth of other algorithms like DES, IDEA, BlowEi ROA CAST and SKI PIACK. Disadvantages imitations 1 tation of keys. 2. Itreapuites shating of secret k Tdoes not sup po Security services, authentication and repudiation SPECTRUM @LLIH-ONE JOURNAL FOR ENGINEERING STUDENTS Smad wih Caner ion, Afier this, both the parties ,32, CRYPTOGRAPHY AND NETWORK SECURITY LNTU-HYOERABAp| 952. Wh: xy eryptosystems? . OR A Explain the terminologies used in encryption. ‘Answer : Public-key eryptographiy was invented by Diffie and Hellman in the year 1976. For this reason, itis sometimes known Diffie-Hellman encryption, Itis also known as a asymmetric eryptography. It is form of eryptography in which user has a pg ‘of cryptographic keys ice, a public-key and a private key. The private-key is kept secret, whereas the public-key is distributgy widely. A message or text data which is encrypted with the public-key can be decrypted only with the corresponding private-ey For instance, when Johny wants to send a secure message to Sunny, he uses Sunny’s public-key to encrypt the message, Suny, ‘then uses his private-key to decrypt it. A public-key eryptography/encryption consists of the following five elements, “Text ata/Message Encryption algorithm iii). Publie-key and Private-key (iv) Ciphertex/Unreadable text (v)_ Decryption algorithm. (i) Text Data/Message ‘This can be any input data, such as text data or message. For example, Johny isa user of computer and wants to send his message, 4 is also a user of computer. (Encryption Algorithm To enerypt the message, an encryption algorithm performs ‘There are various encryption algorithms, but the RSA public-key encryption algorithm is mostly used to perform certain transformations or caleulations on the text data or message, For example, Johny uses the public-key of Sunny and enerypted his message by using RSA algorithm. (iD, , Public-Key and Private-key ‘These pair of keys are uécd to encrypt and decrypt the message respectively. The p public-key is widely distributed. For example, Johny uses a public-key of Sunny to encrypt his message, whereas Sunny uses his private key to decrypt the Johny’s message as shown in the figure. (wv) Ciphertex/Unreadable Text : Once the eneryption is done on the text data, itis in unreadable format means it cannot be read by human beings. - For example, Johny’s message has converted into unreadable form so that nobody except Sunny can read his nlessage, hhe has a corresponding private-key for that message. ()__ Decryption Algorithm : A decryption algorithm takes the unreadable text and its corresponding key is used to convert this text into original text Hence, it can be said that the deeryption algorithm is the reverse of encryption algorithm. For example, decryption algorithm takes the unreadable text of Johny and also takes Sunny’s pri at aod convent ih umeadsbe et ino real form, oral ext sent by ony a8 shown ihe ew ing are the principle elements of a publi Oct/Nov.16(813), ox stain transformations on it. -key is always kept secret, whereas Tay Public-key Table ‘ ATT Fh Samy Pte ay sty. aay ‘Sunny's Private-key. : ews ew fe tT) =e |T : Une Tet input RSA Public-key Encryption RSA Publics Output (Org Tex) ‘Nowiius © peaypinmAtpedim —_ (Ohghst Tea) fi r Figure: Publie-key Eneryption 5" WARNING: Xerax/Photocopying of this book is @ CRIMINAL act. Anyone found guily is LIABLE to face LEGAL proceedinga. Sosa wih CanSerrnar
You might also like
Network Security
PDF
No ratings yet
Network Security
10 pages
Unit 1 Introduction1
PDF
No ratings yet
Unit 1 Introduction1
62 pages
Cns
PDF
No ratings yet
Cns
64 pages
Online Search Agents
PDF
100% (2)
Online Search Agents
13 pages
Daa All 4 Units Question Bank Answer Key
PDF
100% (1)
Daa All 4 Units Question Bank Answer Key
41 pages
DM Unit 2
PDF
No ratings yet
DM Unit 2
55 pages
SL Unit-3 Notes!
PDF
100% (1)
SL Unit-3 Notes!
19 pages
Flat (Complete Notes)
PDF
No ratings yet
Flat (Complete Notes)
91 pages
DM Unit 3
PDF
No ratings yet
DM Unit 3
39 pages
Combining Security Associations
PDF
No ratings yet
Combining Security Associations
13 pages
CNS Unit 1 (1) Spectrum Jntuh
PDF
100% (1)
CNS Unit 1 (1) Spectrum Jntuh
35 pages
Unit 5: 1) Reactive Vs Proactive Risk Strategies
PDF
No ratings yet
Unit 5: 1) Reactive Vs Proactive Risk Strategies
10 pages
POE Bits
PDF
No ratings yet
POE Bits
6 pages
DM Unit 5
PDF
No ratings yet
DM Unit 5
47 pages
CD Lab Viva Questions
PDF
No ratings yet
CD Lab Viva Questions
9 pages
Unit 2
PDF
No ratings yet
Unit 2
48 pages
Decision Properties of Regular Languages
PDF
No ratings yet
Decision Properties of Regular Languages
33 pages
CNS - 2
PDF
100% (1)
CNS - 2
22 pages
1) Explain in Detail Core Function of Edge Analytics With Diagram
PDF
No ratings yet
1) Explain in Detail Core Function of Edge Analytics With Diagram
13 pages
CNS Previous Questions Paper-2023
PDF
100% (2)
CNS Previous Questions Paper-2023
2 pages
Fiot Notes
PDF
67% (3)
Fiot Notes
78 pages
IRS Spectrum
PDF
100% (1)
IRS Spectrum
150 pages
Taxonomy of Bugs
PDF
100% (1)
Taxonomy of Bugs
8 pages
4.3 A Ontological engineering in artificial intelligence
PDF
100% (1)
4.3 A Ontological engineering in artificial intelligence
5 pages
PPL Complete Notes Jntuh
PDF
No ratings yet
PPL Complete Notes Jntuh
125 pages
Learning in Artificial Intelligence
PDF
67% (3)
Learning in Artificial Intelligence
8 pages
STM Notes Unit1
PDF
50% (2)
STM Notes Unit1
61 pages
Java Unit 1 Spectrum
PDF
100% (1)
Java Unit 1 Spectrum
61 pages
FIoT Unit 04
PDF
100% (1)
FIoT Unit 04
65 pages
Design of Lexical Analyzer Generator
PDF
100% (1)
Design of Lexical Analyzer Generator
14 pages
STM Unit-4
PDF
No ratings yet
STM Unit-4
36 pages
CNS Lab Manual
PDF
No ratings yet
CNS Lab Manual
32 pages
Viva Questions
PDF
100% (1)
Viva Questions
37 pages
ATCD Important Questions
PDF
No ratings yet
ATCD Important Questions
7 pages
State Testing, and Testability Tips. Power of A Matrix, Node Reduction Algorithm
PDF
100% (1)
State Testing, and Testability Tips. Power of A Matrix, Node Reduction Algorithm
13 pages
Fiot Unit 5
PDF
100% (1)
Fiot Unit 5
27 pages
Localization and Calling: Mobile Station International ISDN Number (MSISDN) : The Only Important Number
PDF
100% (1)
Localization and Calling: Mobile Station International ISDN Number (MSISDN) : The Only Important Number
3 pages
Unit 2 Machine Learning Notes
PDF
100% (1)
Unit 2 Machine Learning Notes
25 pages
Designing A Learning System
PDF
No ratings yet
Designing A Learning System
12 pages
SE Lab Manual R18
PDF
100% (1)
SE Lab Manual R18
60 pages
Unit Wise Possible Questions: Software Engineering
PDF
50% (2)
Unit Wise Possible Questions: Software Engineering
2 pages
CNS 3-1 Lab Manual
PDF
100% (2)
CNS 3-1 Lab Manual
34 pages
CNS UNIT-2 Notes
PDF
100% (1)
CNS UNIT-2 Notes
30 pages
STM Viva Que
PDF
100% (2)
STM Viva Que
54 pages
Classical Planning in AI
PDF
100% (1)
Classical Planning in AI
5 pages
SPPM Unit 2
PDF
100% (2)
SPPM Unit 2
114 pages
Jntuh Iot Le Cture Notes
PDF
No ratings yet
Jntuh Iot Le Cture Notes
92 pages
Jntuh r18 DM Gunshot ? Very Important ??? Questions and Answers
PDF
No ratings yet
Jntuh r18 DM Gunshot ? Very Important ??? Questions and Answers
95 pages
PPL Unit 4
PDF
No ratings yet
PPL Unit 4
21 pages
21cs502 Unit 4 Ai Notes Short
PDF
No ratings yet
21cs502 Unit 4 Ai Notes Short
32 pages
Unit 5
PDF
100% (1)
Unit 5
19 pages
Unit-2.4 Searching With Partial Observations - CSPs - Back Tracking
PDF
100% (2)
Unit-2.4 Searching With Partial Observations - CSPs - Back Tracking
42 pages
1 Compare I-TCP, S-TCP and M-TCP 2 Understand CO3: Assignment # 2
PDF
No ratings yet
1 Compare I-TCP, S-TCP and M-TCP 2 Understand CO3: Assignment # 2
8 pages
Non-Deterministic Reward and Action
PDF
No ratings yet
Non-Deterministic Reward and Action
2 pages
DWM - Viva and Short Question Answers
PDF
No ratings yet
DWM - Viva and Short Question Answers
24 pages
Jntu SL Lab Manual
PDF
No ratings yet
Jntu SL Lab Manual
33 pages
Subject:Machine Learning Unit-5 Analytical Learning Topic:Remarks On Explanation Based Learning
PDF
100% (1)
Subject:Machine Learning Unit-5 Analytical Learning Topic:Remarks On Explanation Based Learning
21 pages
Cloud Computing Viva Question & Answer
PDF
0% (1)
Cloud Computing Viva Question & Answer
9 pages
AI Unit-3 Notes
PDF
No ratings yet
AI Unit-3 Notes
23 pages
COMPILER DESIGN Unit 5 Two Mark With Answer
PDF
No ratings yet
COMPILER DESIGN Unit 5 Two Mark With Answer
7 pages
Compiler Design Two Marks
PDF
50% (2)
Compiler Design Two Marks
17 pages
Unit Wise Questions V Mca Unit 1 Introduction To AI
PDF
100% (2)
Unit Wise Questions V Mca Unit 1 Introduction To AI
2 pages
PPL Unit-1
PDF
100% (1)
PPL Unit-1
19 pages
Unit 2 FIOT
PDF
No ratings yet
Unit 2 FIOT
7 pages