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

Public key cryptosystem based on rsa technology, Problem: (a) What is ...

Problem: (a) What is the minimum length of a password that could be considered to be "strong" in the context of today's computing power? (b) The security of a PIN system,

Draw a suitable physical network diagram, Question a) From the capture ...

Question a) From the capture below: Give the datagram source IP address, upper layer protocol, Total length in decimal and header checksum in hexadecimal; the segment source po

Develop firewall rules, Question requires you to develop firewall rules bas...

Question requires you to develop firewall rules based on a fictitious organisation. Scenario: You work for a security-conscious company, xC-Cure, who develop encryption tec

Using icmp reachability, USING ICMP TO TEST REACHABILITY:  ICMP can a...

USING ICMP TO TEST REACHABILITY:  ICMP can also be used to test several tools. An Internet host A, is reachable from another host B, if data packets can be send from A to B. P

Traditional network design approach, Question: a) Give two reasons why ...

Question: a) Give two reasons why the building-block approach is favoured to the traditional network design approach. b) With reference to network monitoring parameters, dis

Use the chinese remainder theorem to evaluate x, Use the Chinese remainder ...

Use the Chinese remainder theorem to evaluate x from the following simultaneous congruences: x ≡ 1 (mod 2); x ≡ 2 (mod 3); x ≡ 3 (mod 5). Calculate gcd(14526, 2568). (

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?

Sending an arp message, Normal 0 false false false EN-U...

Normal 0 false false false EN-US X-NONE X-NONE

Mobile wireless networks , Is standard TCP effective in mobile wireless net...

Is standard TCP effective in mobile wireless networks that operate with the IEEE 802.11 wireless local area network protocol?Discuss the issue

Identified issues in networks, The "Big Red Rocks" (BRR) mining company is ...

The "Big Red Rocks" (BRR) mining company is based and operates in Western Australia. They are primarily an iron ore miner, but they also produce electricity through tidal power to

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