We accept

Draw Model For Network Security Computer Knowledge Essay

SENDER: Sender transfer note to other party through some kind of internet. Recipient: Receiver receives subject matter send by sender through some sort of internet. Trusted alternative party: trusted third party is necessary o secure the communication transmits from one party to another. Third party distributes magic formula information to both parties. Third party actually provides authenticity of message transmission.

Opponent: An opposition can be considered a real human or a virus that could harm the transmitted subject matter going through some kind of internet.

Secure communication: It is a note to which a key key is applied which is not in readable by opposition.

Secret information: Hidden knowledge information is a key applied to message.

Ques2:How come polyalphabetic substitution superior to monoalphatic substitution.

Ans: Polyalphabetic ciphers use multiple substitution alphabetic.

A monoalphabetic substitution replaces each notice with another notice regarding to cipher alphabet. Polyalphabetic substitution is superior than monoalphabetic because polyalphabetic substitutions are evidently better than monoalphabetic substitution, because rate of recurrence distribution displays the distribution of the underlying alphabet.

Ques3:Why are normal encryption /decryption method not suitable for bank.

Ans: Conventional encryption/decryption method is not well suited for bank since it is less secure.

If standard encryption/decryption is using, then your limitation is that the tips must be shared between members before decryption can occur.

If an asymmetric cipher can be used instead, only open public keys have to be shared -- private keys need not be share.

Symmetric encryption is the oldest and best-known strategy. A hidden knowledge key, that can be a number, a expression, or just a string of random letters, is put on the text of a note to change this content in a particular way. This may be as easy as shifting each letter by a number of places in the alphabet. So long as both sender and receiver know the secret key, they can encrypt and decrypt all messages that use this key.

Asymmetric Encryption: The situation with secret keys is exchanging them online or a huge network while stopping them from falling into the wrong hands. Anyone who is aware of the trick key can decrypt the concept. One answer is asymmetric encryption, where there are two related keys--a key pair. A general public key is made freely available to anyone who might want to send you a message. A second, private key is stored magic formula, so that only you understand it. Any note that are encrypted utilizing the public key can only be decrypted by applying the same algorithm, but utilizing the matching private key. Any note that is encrypted by using the private key can only just be decrypted utilizing the matching general public key.

This means that you do not have to be anxious about passing public keys online. A difficulty with asymmetric encryption, however, is that it's slower than symmetric encryption. It requires far more processing power to both encrypt and decrypt the content of the note.

Ques4:Define types of assault based on what exactly is recognized to attacker.

Ans: Listed below are the cryptographic attacks usually performed by an attacker:

Known plaintext attack: In a very known plaintext episode, an attacker must have both the plaintext and ciphertext of 1 or more communications. Both of these items are being used to extract the cryptographic key and recover the encrypted text message.

Ciphertext only attack: In this harm, an attacker obtains encrypted messages which may have been encrypted using the same encryption algorithm. For example, the initial version of WEP used RC4, in case sniffed long enough, the repetitions would allow a hacker to extract the WEP key. Such types of episodes do not require the attacker to have the plaintext because the statistical analysis of the sniffed log is enough.

Man-in-the-middle attack: With this form of invasion, an attacker places himself in the middle of the communications flow between two people. Once an attacker enters the communications move, the guy can perform a ciphertext only invasion, exchange bogus keys, etc.

Replay harm: In this type of invasion, an attacker will try to repeat or postpone a cryptographic transmission. A replay assault can be prevented using program tokens.

Chosen plaintext harm: Within a chosen plaintext harm, an attacker somehow accumulates the information to be encrypted and requires a copy of it with the encrypted data. This can be used to find habits in the cryptographic result that might uncover a vulnerability or show a cryptographic key.

Chosen ciphertext assault: In this type of harm, an attacker can choose the ciphertext to be decrypted and can then analyze the plaintext productivity of the function. The early types of RSA used in SSL were actually susceptible to this strike.

1:Cipher content material only attack

Given cipher encrypted with same key

C1=Ek (p1), C2=Ek(p2)

Attackers find key.

2:Known plain text message attack

Plain words is related to the cipher text.

Eg: P1, C1=Ek(P1) P2, C2=Ek(P2)

3:Chosen plain word attack

Plain text message can be chosen that gets encrypted.

4:Adaptive chosen basic text attack

Can alter the plain word choice depending on results of past encryption.

5 :Chosen cipher text message attack

Can choose different cipher texts to be decrypted.

Ques6:Encrypt the next plaintext by playfair substitution "wearediscoveredsaveyourself"

Ans:Playfair is a multi-letter encryption which snacks diagrams in the plaintext as an individual devices and translates these units into ciphertext diagrams.

The Playfair algo is based on use of 5*5 matrix of words constructed by using a key.

Choosen key is "WONDERS"


























The matrix is made by filling in the letters of the keyword "WONDERS" from remaining to right and top to bottom level and then filling in the remainder of the matrix with the rest of the words in alphabetic order. The words I and J matter as one letter.

Rules will be : 1:Repeating plaintext words that are in same set are segregated with a filler letter.

2: Two plaintext letters that show up in the same of matrix are each changed by the notice to the right circularly.

3:Two plaintext letters that fall season in the same column are each replaced by the letter beneath to it.

4:Otherwise, each plaintext notice in a pair is substituted by the notice that lies in its own row and the column occupied by the plaintext letter.


Playfair substitution is 'OWBSWEHGABEBCGKNASXDZWFCOUL"gtttttttttfygjhvhghjqqQQCh

More than 7 000 students trust us to do their work
90% of customers place more than 5 orders with us
Special price $5 /page
Check the price
for your assignment