Scribd Logo
Upload

Welcome to Scribd!

  • 81 views

    CSS Notes

    Uploaded by

    Yash Bavaskar
    This document provides an overview of several cryptographic concepts and algorithms: 1. It describes symmetric and asymmetric key cryptography, including common algorithms like AES, DES, RSA, Diffie-Hellman, and key exchange. 2. It also covers classical ciphers like the Playfair cipher, monoalphabetic and polyalphabetic ciphers. 3. Modes of symmetric key encryption like ECB and CBC are defined. Cryptographic protocols like RSA, ElGamal, and Diffie-Hellman key exchange are explained. Hash functions and MD5 are summarized.

    Copyright:

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

    CSS Notes

    Uploaded by

    Yash Bavaskar
    81 views5 pages
    This document provides an overview of several cryptographic concepts and algorithms: 1. It describes symmetric and asymmetric key cryptography, including common algorithms like AES, DES, RSA, Diffie-Hellman, and key exchange. 2. It also covers classical ciphers like the Playfair cipher, monoalphabetic and polyalphabetic ciphers. 3. Modes of symmetric key encryption like ECB and CBC are defined. Cryptographic protocols like RSA, ElGamal, and Diffie-Hellman key exchange are explained. Hash functions and MD5 are summarized.

    Original Title

    CSS notes

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of several cryptographic concepts and algorithms: 1. It describes symmetric and asymmetric key cryptography, including common algorithms like AES, DES, RSA, Diffie-Hellman, and key exchange. 2. It also covers classical ciphers like the Playfair cipher, monoalphabetic and polyalphabetic ciphers. 3. Modes of symmetric key encryption like ECB and CBC are defined. Cryptographic protocols like RSA, ElGamal, and Diffie-Hellman key exchange are explained. Hash functions and MD5 are summarized.

    Copyright:

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

    CSS Notes

    Uploaded by

    Yash Bavaskar
    This document provides an overview of several cryptographic concepts and algorithms: 1. It describes symmetric and asymmetric key cryptography, including common algorithms like AES, DES, RSA, Diffie-Hellman, and key exchange. 2. It also covers classical ciphers like the Playfair cipher, monoalphabetic and polyalphabetic ciphers. 3. Modes of symmetric key encryption like ECB and CBC are defined. Cryptographic protocols like RSA, ElGamal, and Diffie-Hellman key exchange are explained. Hash functions and MD5 are summarized.

    Copyright:

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

    Sr.

    8 CSB604 2017PE842 Yash Bavaskar

    Symmetric key cryptography is also called a secret key cryptography.


    In symmetric key cryptography a single ey is used for encryption as well as decryption
    The symmetric key algorithm called as Data Encryption Standard (DES), example AES,
    BLOWFISH

    Asymmetric key Cryptography is also called public key cryptography. In asymmetric key
    cryptography two keys are used, one for encryption and another for decryption.
    A public key is known to everyone and can be used to ecrypt messages and verify signatures.
    The private key is known only to receiver of the message ot verifier ,used to decrypt messages
    and sign (create) signatures example RSA , Diffie Hellman and Key exchange algorithm

    Play fair cipher


    Uses 5X5 matrix table to store the letters of the phrase given for encryption which later on
    becomes a key for encryption and decryption.

    monoalphabetic Cipher

    In this cipher substitutes one letter of the alphabet with any random letter from the alphabet.

    Polyalphabetic Cipher
    Monoalphabetic cipher is easy to break however Polyalphabetic cipher uses more than one
    alphabet and switches between them systematically.’

    Module 2

    Symmetric Key Crytopgrahy


    1. Electronic Codebook mode (ECB)
    a. EBC mode the given plaintext message is divided into blocks of 64 bits each and
    each 64-bits blocks get encrypted independently.The plaintext block produces
    ciphertext of same size.
    b. tThe given Plaintext is encrypted using same key and transfer s the encrypted
    data to receiver
    c. The receiver end each block is decrypted independently using the same key in
    order to produce original plaintext message of same size.
    2. Cipher Block Chaining Mode
    a. In CBC mode each block of plaintext is XORed with the previous ciphertext block
    before being encrypted.
    b. In CBC mode the first block of the mass
    c.
    RSA algorithm: It is a public-key encryption algorithm.It is a block-cipher which converts plain
    text into cipher text at sender side and vice versa at receiver side

    There are four possible attacks on RSA as follows:


    1: Brute force attack : hacker triess all possible private key
    2: Mathematical attacks: Hackers attacks on i.e tries to factorize the product of two prime
    numbers.
    3:Timing attacks: it totally depends on running time of decryption algorithm
    4: Chosen Ciphertext attack: Haccker tries to attack on the properties of the RSA algorithm

    ElGama Algorithm

    ElGama cryptosystem called Elliptic Curve Variant, is based on the Discrete Logarithm Problem.
    It derives the strength from the assumption that the discrete logarithms cannot be found in
    practical time frame for a given number while the inverse operation of the process can be
    computed efficiently

    The generatio of an ELgama key pair is comparatively simpler than the equivalent process for
    RSA. But the encryption and decryption are slightly more complex than RS

    To encrypt the first plaintext as series of numbers modulo p


    Randomly generate a number k
    Compute two values C1 and C2 weat+

    Diffie Hellman Key Exchange


    This algorithm is used to generate the same symmetric private cryptographic key at the sender
    as well as receiver end so that there is no need to transfer this key from sender to receiver.
    This algorithm is used only for key agreement and not for encryption or decryption of message

    Properties of Hash Function


    There are main 4 properties of hash function:
    1. Quick to compute the hash value for any given message
    2. It is infeasible to generate a message from its hash value except by trying all possible
    angemessages
    3. A small change to a message should change the hash value so extensively that the new
    hash value appears uncorrelated with the old hash value
    4. It is infeasible to find two different message with same hash value
    MD5

    This algorithm takes an input of arbitrary length and 128 bit message digest is produced. The
    input message is produced in 512 - bit blocks

    Steps for MD5


    1.Append padding Bits- The message os padded to make the length of message is 448 mod
    512
    2.Append Length-64 bits of original message is appended to the result
    3.Initialize MD Buffer
    4.Process Message in 512 bit blocks
    5.Output

    Define SQL Injection

    It is an attack that poisons malicious SQL statements to database. It helps you


    to take benefit of the design flaws in poorly designed web applications to
    exploit SQL statements to execute malicious SQL code. In many situations,
    an attacker can escalate SQL injection attack in order to perform other attack,
    i.e. denial-of-service attack.

    What is Nmap?

    Nmap is a tool which is used for finding networks and in security auditing.

    Explain the concept of cross-site scripting.

    Cross-site scripting refers to a network security vulnerability in which


    malicious scripts are injected into websites. This attack occurs when attackers
    allow an untrusted source to inject code into a web application.

    Explain TCP Three-way handshake.

    It is a process used in a network to make a connection between a local host


    and server. This method requires the client and server to negotiate
    synchronization and acknowledgment packets before starting communication.
    Digital Certificates

    Digital certificate is an electronic file that is used to identify people and


    resources over an insecure channel or network called the Internet

    . Digital certificates also enable secure confidential communication between


    sender and receiver using encryption.

    Kerberos Authentication Protocol

    Kerberos uses the concept of the ticket as a token to prove the identity of the
    user. Kerberos uses the concept of a ticket as a token that proves the identity
    of a user.

    Tickets are digital documents that store session keys.Instead of passwords ,


    tickets are issued during login session and then can be used in any Kerberos
    services. In kerberos these tickets includes different contents like time stamps
    to indicate an, start and expiration time, after time expiration the ticket become
    invalid.

    Digital Signature

    Digital Signature is represented in a computer as a string of binary digits and


    the computer is using a set of rules and regulations to identify the person
    signing the document as well as the originality of the data can be verified.

    Digital signature techniques achieve the authenticity, integrity and non


    repudiation of the data over Internet

    Digital signature goals:

    Message authentication - Digital signature technique can provide message


    authentication. Digital signature is used to establish proof of identities and
    ensure that the origin of an electronic message is correctly identified
    Message integrity- Digital signature are used to detect unauthorized
    modification to data which assures that the contents of message are not
    changed after sender sends but before it reaches to intended receiver

    Non-repudiation- There are situations where a user sends a message and


    later on refuses that he had sent that message. This is known as non
    repudiation because the person who signed the document cannot repudiate
    the signature at a later time.

    RSA signature scheme: It is a block cipher which converts plain text into
    cipher text at sender side and vice versa at receiver side

    DDS-Digital Signature Standard

    You might also like