--%>

Encryption

Explain the term Encryption.

E

Expert

Verified

Encryption: At the core of most security services are encryption algorithms. These are functions that take as input a stream of bits (plaintext) and produce an output (cipher text) that bears no resemblance to the input. The encryption algorithm is reversible hence an authorized party can take the output and recover the original input. This process is called decryption. Encryption/decryption algorithms by themselves are very difficult to keep secret, and if revealed would invalidate the algorithm for future use. Hence, modern algorithms also include a key which will determine exactly how the algorithm will work in a given situation. If the key is compromised a new key can be chosen and the same algorithm can be used.

The primary characteristic of an encryption algorithm (and the usual approach to attacking one) is that there are no repetitive patterns in the cipher text and that patterns in the cipher text can not be related to simi lar patterns in the plaintext. For example, consider the simple substitution codes, which offset the alphabet by a fixed number of characters. So that A maps to F, B maps to G, and so on wrapping around when it gets to the end so that Z maps to E. It turns out that the frequencies of certain letters in different languages are well known and can be used to break a code like this quite easily. Similar patterns can be found for pairs of characters, etc. So a good encryption algorithm must try to mask the patterns that are inherent in the plaintext.

Encryption algorithms are classified into two broad categories-symmetric and asymmetric. These two categories differ in the number of different keys used, the operations performed, and the algorithm efficiency.

   Related Questions in Computer Network Security

  • Q : Mono-alphabetic and Playfair cipher

    Define: a) Mono-alphabetic cipher b) Playfair cipher c) Transposition cipher

  • Q : Security Requirements and Attacks

    Explain the term Security Requirements and Attacks in network security.

  • Q : IP addressing and Subnetting

    Assumption: All subnet values can be used and the all "0"s is the first subnet. Question 1 - You have been assigned the 160.5

  • Q : Problems related to Cryptography and

    A) Provide a specific illustration of how inference control might be implemented in the database.B) For a public-key encryption system (like PGP), list some areas for and against utilizing the similar key pair for both encryption and signature.

  • Q : Wired equivalent privacy or WEP-LAN

    WEP (wired equivalent privacy): Wired equivalent privacy is capable of providing the same level of privacy as it is there in the wired network. The WEP makes use of a static key which both the access points and the clients know. The static key helps i

  • Q : Threat Statement Define the term Threat

    Define the term Threat Statement and what are their consequences?

  • Q : Ip Question 4 - You have been asked to

    Question 4 - You have been asked to design an IP addressing plan for a medium size corporation, Corporation (X) converting to an IP network. The corporation currently has 88 locations but plans to expand to approximately 100 Locations within the next year. Each location should have a user network

  • Q : Rot Word and Shift Rows Explain

    Explain difference between the Rot Word and Shift Rows?

  • Q : Sub Word and Sub Bytes Explain

    Explain difference between the Sub Word and Sub Bytes?

  • Q : Competition matrix-Michael Porters

    The competition matrix is a term used while talking about strategy development, first used by Michael E. Porter 1983. They tell about product politics in marketing for individual business fields of an enterprise to gain competition advantage. In this,