Function of key secrecy and algorithm secrecy in security, Computer Network Security

Assignment Help:

What is the function of key secrecy and algorithm secrecy in security? 

Algorithm Secrecy is explained as follows:

‘Algorithm secrecy’ is a method of keeping an algorithm secret from unauthorized users. A concept which is based on the secrecy of the algorithm is frequently referred to as secrecy through obscurity, which gives us security by hiding the data in the obscure location. But, the system using this concept might suffer from number of security vulnerabilities. The disadvantage of using algorithm secrecy is that it is not easy to maintain the secrecy of the system because when algorithms  are  known  by the  unauthorized  users,  an  totally  new  secret  algorithm  is  to  be developed for performing the encryption and decryption of cipher text. Additionally to algorithms, it would be essential to change keys as well.

Key Secrecy is explained below:

In cryptography, a key refers to a small piece of information with which the functional result of the cryptographic algorithm is recognized. When a key is not used, the algorithm will not create any result. In encryption, a key is used to transform the plaintext into cipher text or vice versa in case of decryption. Several cryptographic algorithms such as message authentication codes and digital signature schemes use key for purpose of security. “Key” security can be simply managed when compared to “encryption algorithm” protection. Though, the length of the key should be as long as possible so as to give us a strong security.

When the key is known by the unauthorized users, it can be simply changed. Therefore, the security of an encryption system mainly depends on a certain key, which is being kept secret.

`Practically, it is hard to provide key secrecy in cryptography. For example, when an attacker attains the key, the original message can be retrieved from encrypted data.

Encryption algorithms which make use a similar key for performing encryption and decryption both is referred to as symmetric key algorithms.  The other public key cryptographic algorithms which make use of two different keys for encryption and decryption are called as asymmetric key algorithms. In asymmetric key algorithms, one key is made public, and the other is kept private. Thus, it is extremely complicated for the unauthorized users to determine the private key even if the corresponding public key is known. A user of public key technology keeps the private key secret and discloses public key so that anybody can send them an encrypted message.


Related Discussions:- Function of key secrecy and algorithm secrecy in security

What is the maximum achievable data rate, Question: a) How many bits pe...

Question: a) How many bits per second can be sent on a noiseless 4 MHz channel if four-level digital signals are used? b) If a binary signal is sent over a 3 KHz channel who

Locality of reference , LOCALITY OF REFERENCE PRINCIPLE:  Principle of...

LOCALITY OF REFERENCE PRINCIPLE:  Principle of "Locality of Reference" use to predict computer interaction patterns. There are two patterns shown as follows: a) Spatial loca

Describe des encryption, (a) Describe DES encryption with a block diagram a...

(a) Describe DES encryption with a block diagram and brief steps. (b) How does triple DES improve security. What is the effective key length of triple DES? How can 3DES be compa

Ip datagram, IP DATAGRAM Various options can be included to IP header,...

IP DATAGRAM Various options can be included to IP header, e.g., source route, record route and timestamp. Header with no function has H. LEN field value 5; data starts immedia

Structure of a typical frame relay, Problem a) Consider a 1000 Mbps Eth...

Problem a) Consider a 1000 Mbps Ethernet with a single Store-N-Forward switch mid-way in the path between two nodes A and B. Assume that there are no other nodes on the network

Computer forensic, discuss the merits and demerits of computers freezing

discuss the merits and demerits of computers freezing

Man-in-the-middle attacker, - Alice, Bob and Charlie have a secret key a=3,...

- Alice, Bob and Charlie have a secret key a=3, b=4, c=5, in that order. - They would like to find a common secret key using Diffie-Hellan key exchange protocol (with g=2, p=5).

Csma/ca, CSMA/CA Wireless needs collision avoid ness rather than colli...

CSMA/CA Wireless needs collision avoid ness rather than collision checking. Transmitting computer puts very short codes to receiver. Receiver responds with short message getti

Network simplex method, QUESTION: (a) Briefly explain the steps invol...

QUESTION: (a) Briefly explain the steps involved in Network Simplex Method. (b) What data structures you would expect in the Network Simplex Method. Show the data struct

Determine the round trip time, a) determine the RTT (round trip time) betwe...

a) determine the RTT (round trip time) between a client requesting a web page of 1024 bytes in size from an internal web server on a 100 Base-T Ethernet. Assume a one-way propagati

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd