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

Calculate the total latency, Question (a) Inspect the following ifconfi...

Question (a) Inspect the following ifconfig output of an IPv6 interface: i. What is the hidden Hardware Address of the interface on Line #1? ii. What is the hidden subn

Explain how the diffie-hellman key agreement protocol works, (a) Using Fer...

(a) Using Fermat's theorem, find 3 201 mod 11. (b) Explain how the Diffie-Hellman key agreement protocol works and what its purpose and main properties are. Consider a Dif

Describe how a cellular network works, Problem 1 . Show various features of...

Problem 1 . Show various features of a 1G network Total three features for each feature of 1G Problem 2. Describe how a cellular network works with functional block diagram

What is b-router, B-Router Hybrid devices that has the features of bot...

B-Router Hybrid devices that has the features of both routers and bridges . A bridge router or brouter is a network machine that acts as a router and as a bridge. The brout

Briefly list functions of a public key infrastructure, Question: (a) Wh...

Question: (a) What is the major problem with public key encryption when compared to symmetric key encryption? (b) Consider the following protocol for communication between t

Ring topology, RING TOPOLOGY In this topology of network the devices a...

RING TOPOLOGY In this topology of network the devices are connected to each other in packed loop. In this network first computer passes data packet to the second and then seco

Address resolution with message exchange, ADDRESS RESOLUTION WITH MESSAGE E...

ADDRESS RESOLUTION WITH MESSAGE EXCHANGE An alternative to local calculation is a distributed function. A computer that requires to find an address transmits a message across

Describe the two possible configurations for 3des, QUESTION (a) Describ...

QUESTION (a) Describe the two possible configurations for 3DES (b) What is the main disadvantage of 3DES? (c) Why are most modern symmetric algorithm block ciphers? (d

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

Ip Datagram, Size of Option field of an ip datagram is 20 bytes. What is th...

Size of Option field of an ip datagram is 20 bytes. What is the value of HLEN? What is the value in binary?

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