Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Module 4

    Uploaded by

    Abhinandan Sinha

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Module 4

    Uploaded by

    Abhinandan Sinha
    7 views3 pages

    Original Title

    module 4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views3 pages

    Module 4

    Uploaded by

    Abhinandan Sinha

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Q. What is asymmetric key alogithms? List some common Asymmetric key algorithms?

    Asymmetric key algorithms, also known as public-key algorithms, are cryptographic algorithms
    that use a pair of keys for encryption and decryption: a public key and a private key. asymmetric
    key algorithms are typically slower and require more computational resources than symmetric key
    algorithms.

    How asymmetric key algorithms work:

    1. Key Generation: Each user generates a key pair consisting of a public key and a private
    key. The public key is shared openly, while the private key is kept secret.
    2. Encryption: To send a message to someone, the sender uses the recipient's public key to
    encrypt the message. Once encrypted, only the recipient, who possesses the
    corresponding private key, can decrypt the message.
    3. Decryption: The recipient uses their private key to decrypt the ciphertext and recover the
    original plaintext.

    Advantages:

    • Key Distribution: As the public key can be freely distributed, there's no need for a
    secure channel to exchange keys.
    • Authentication: Asymmetric algorithms can be used for digital signatures, allowing a
    sender to sign a message with their private key, and others to verify the signature using
    the sender's public key.
    • Non-Repudiation: Since only the sender possesses the private key, they can't deny
    having sent a message that's been signed with their private key.

    Two algorithms are:-


    1. RSA (Rivest-Shamir-Adleman)
    2. DSA(Digital Signature Algorithm)

    Both are used for secure data transmission and digital signature

    What is a Message Digest or Hash Value?


    A message digest or hash value is a numeric string generated using the cryptographic
    hash function. The message string is passed to the hash function. Hash function
    computes a unique hash value for the provided message and this hash value acts as
    digital fingerprint of the message.

    How Does a Message Digest Work?


    Message digest works as a digital fingerprint for the message. In the communication
    channel, the sender and receiver communicate with each other so both must receive
    the right message. to ensure the integrity of the message digest is sent by the sender
    to the receiver along with the message. The receiver receives the message and the
    message digest value and the receiver uses the same hash function to generate a new
    message for the message he/she received. once generated receiver compares both the
    message digest values to verify that the message is received without any modifications
    and corrections. If both digest values are the same, it proves that the message has not
    been modified in the network by any person. Different digest values indicate that the
    received message is not the actual message send by the sender. This way we could
    check and verify the integrity of the message using message digest. For more clarity
    refer to the below example:
    # RSA ALGORITHM IN CRYPTOGRAPHY

    • y
    RSA algorithm is an asymmetric cryptography algorithm. Asymmetric actually means that it
    works on two different keys i.e. Public Key and Private Key. As the name describes that the
    Public Key is given to everyone and the Private key is kept private.

    The idea of RSA is based on the fact that it is difficult to factorize a large integer. The public
    key consists of two numbers where one number is a multiplication of two large prime numbers.
    And private key is also derived from the same two prime numbers. So if somebody can factorize
    the large number, the private key is compromised. Therefore encryption strength totally lies
    on the key size and if we double or triple the key size, the strength of encryption increases .
    1. Authenticity: The identity of the signer is verified.
    2. Integration: Since the content was digitally signed, it hasn’t been altered or
    interfered with.
    3. Non-repudiation: demonstrates the source of the signed content to all parties.
    The act of a signer denying any affiliation with the signed material is known as
    repudiation.

    #Hash_function

    • Hash functions are mathematical operations that "map" or change a given


    collection of data into a fixed-length bit string that is referred to as the "hash
    value."
    • Hash functions have a variety of complexity and difficulty levels and are used
    in cryptography.
    • Cryptocurrency, password security, and communication security all use hash
    functions.

    You might also like