Skip to main content

Digital Signature

 .

Digital signature

  • A digital signature is an electronic, encrypted, stamp of authentication on digital information such as email messages or electronic documents. 
  • A signature confirms that the information originated from the signer and has not been altered. 
  • It provides the highest levels of security and universal acceptance. 

Working of Digital Signature

Sender’s side 

  • When the sender electronically signs a document two keys are generated: Public and Private. 
  • The private key is kept by the signer and it should be kept securely. On the other hand, the receiver must have the public key to decrypt the message. 
  • Then the Hash function is used on the document to create Hash, which is also known as digest. 
  • Then the private key is used to encrypt hash. 
  • The document is sent to the recipients along with the sender's public key. 

Receiver’s side

  • The recipient receives the document and decrypts the encrypted hash with the sender's public key certificate. 
  • A cryptographic hash is again generated on the recipient's end using the same hash function that the sender used. 
  • Both cryptographic hashes(of sender and receiver) are compared to check its authenticity. 
  • If they match, the document hasn't been tampered with and is considered valid. 


Comments

Popular posts from this blog

Important Questions of Data Structure and Algorithm (DSA)

 . 1. What is Data structure? Explain different operations to be performed on data structure. 2. Define stack as ADT. Convert P+Q-(R*S/T+U) - V*W into infix expression to postfix. 3. Define Queue. Explain its type with example. 4.  Difference between stack and Queue. 5. Difference between Linear Queue and circular Queue. 6. Write an algorithm to enqueue and dequeue data element in a circular queue.                              7. Define Linked List. Explain its type. How does double linked List is different from circular linked   List. 8. What is recursion and recursive function? write a recursive function to compute Fibonacci number. 9. What is an AVL tree ? Create an  AVL tree from the following data:      18, 12, 14, 8, 85, 25, 31, 24, 27 10. Define B-tree? How to insertion and deletions of elements can be done in a B-tree. 11. Create an B-tree from the following Data:  ...

Important questions of C programming (BCA)

 . What is the characteristics of a good program? Explain types of language processor. Explain any two system design tools. Explain Program Development Life Cycle. Define programing techniques. Different between top-down and button - up approach with suitable example. Difference between cohesion and coupling. Define identifiers, constants, variables and keywords. Explain datatypes. Explain different types of  datatypes available in C. Define operator. Explain its types with suitable example. Explain decision making statement. Explain its type with example. Difference between while, do while loop, for loop. Write a program to find the fibonacci  sequence. What is jumping statement. Explain its types with suitable example.    Write a program to display following:               *               **               ***         ...

BCA Math II old question model solution

 . BCA Math II question model 2018: BCA Math II question model 2019: BCA Math II question model 2020: