Explain the technique used in asymmetric key cryptography, Computer Engineering

Assignment Help:

Explain the technique used in the asymmetric Key Cryptography.

Asymmetric or public-key cryptography be different from conventional cryptography in which key material is bound to a single user. This key material is divided in two components:

  • A private key, to that only the user has access, and
  • A public key that may be published or distributed on request.

Each key makes a function used to transform text. The private key makes a private transformation function and the public key makes a public transformation function. The functions are inversely associated, that is, if one function is utilized to encrypt a message, another is used to decrypt the message. The order wherein the transformation functions are invoked is irrelevant. See that the key material is used to produce the transformation functions, the meaning as private key and public key not only reference the key values, although also the transformation functions. For illustration, the phrase, ''the message is encrypted by using the message recipient's public key'', implies the recipient's public key transformation function is invoked by using the recipient's public key value and the message like inputs, and a cipher text representation of the message is produced as output.

The advantage of a public-key system is as two users can communicate securely without exchanging secret keys. For illustration, assume an originator requires sending a message to a recipient, and secrecy is needed for the message. The originator encrypts the message by using the recipient's public key. Merely the recipient's private key can be utilized to decrypt the message. This is because of the computational infeasibility of inverting the public key transformation function. Conversely, without the recipient's private key, this is computationally infeasible for the interceptor to transform cipher text in its original plain text.


Related Discussions:- Explain the technique used in asymmetric key cryptography

What is a resource-allocation graph, What is a resource-allocation graph? ...

What is a resource-allocation graph? Deadlocks can be described more precisely in terms of a directed graph known as a system resource allocation graph. This graph having of a

Concept of pipelining, Describe the concept of pipelining. Ans: Pipeli...

Describe the concept of pipelining. Ans: Pipelining is the means of executing machine instructions concurrently. This is the effective way of organizing concurrent activity in

Find minimal expression for sop, Consider the following expression. Assume ...

Consider the following expression. Assume that complement inputs are available. F(A,B,C,D) = ∑m (0,1,3,5,9,12,14) + ∑d (4,10,15) 1. Find minimal expression for SOP. Draw gate ne

State about the logic micro-operations, State about the Logic Micro-operati...

State about the Logic Micro-operations These operations are performed on binary data stored in register. For a logic micro-operation each bit of a register is treated as a diff

Write a program that finds the minimum total number of shelv, Write a progr...

Write a program that finds the minimum total number of shelv, C/C++ Programming

Basic characteristics of an experts system, An experts systems must perform...

An experts systems must perform well that is achieve the same levels of performance in the domain of interest that human experts can achieve. But simply producing good so

Drawing sequential circuit on paper, design a sequential circuit that conti...

design a sequential circuit that continuously computes the function 2X + 3 or 3X + 1 where the variable X is a three-bit unsigned integer available on a serial interface. A special

What are the various design constraints, What are the various Design constr...

What are the various Design constraints used while performing Synthesis for a design? 1. Make the clocks (frequency, duty-cycle). 2. Explain the transition-time requirements

Handlers classification, Handler's Classification In 1977, Wolfgang Han...

Handler's Classification In 1977, Wolfgang Handler proposed an detailed notation for expressing the parallelism and pipelining of computers. Handler's classification addresses

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