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

Address resolution with closed-form computation, ADDRESS RESOLUTION WITH CL...

ADDRESS RESOLUTION WITH CLOSED-FORM COMPUTATION For networks use reliable addressing, it is possible to select an address that creates closed-form address resolution possible.

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,

How does tcp perform the functions, Problem: (a) Assume that a new ap...

Problem: (a) Assume that a new application layer protocol is developed for video conferencing application. Which transport layer protocol, between TCP and UDP, will you u

Growth of lan technology, GROWTH OF LAN TECHNOLOGY The production of s...

GROWTH OF LAN TECHNOLOGY The production of shared communication channels (LANs) started in 1960s and early 1970. The basic idea behind was to reduce the number of connectio

Star topology, In Star topology all computers are connected using a cen...

In Star topology all computers are connected using a central device known as hub. Star networks are one of the most general computer network topologies. In its simplest way, a

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

Ipv6 next header, IPV6 NEXT HEADER It is given in the figure below:

IPV6 NEXT HEADER It is given in the figure below:

Arp responses, ARP RESPONSES Let's search out how does a computer know...

ARP RESPONSES Let's search out how does a computer know whether an incoming frame have an ARP message. The type field in the frame header defines that the frame contain an ARP

Elliptic Curves, #questioAn elliptic curve y^2=x^3+ax+b(mod29) includes poi...

#questioAn elliptic curve y^2=x^3+ax+b(mod29) includes points P=(7, 15) and Q=(16, 13) a)Determine the equation of the crve b) Determine all values of x for which there is no point

Explain briefly how go-back-n operates, Question: a) There are two basi...

Question: a) There are two basic approaches to dealing with errors in the presence of pipelining. One way is Go-Back-N and the other strategy is Selective Repeat. i. Explain

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