Scribd Logo
Upload

Welcome to Scribd!

    • 50 views

    Secure Digital Encryption

    Uploaded by

    deepankan
    This document provides information about secure encryption and public key encryption systems. It discusses how public key encryption works using a public key to encrypt messages that can only be decrypted by the corresponding private key. The key attributes of symmetric versus asymmetric encryption are compared. RSA encryption is described as operating with arithmetic mod n where the encryption and decryption keys allow encoding and decoding messages. Examples are given to illustrate public key encryption.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT or read online from Scribd

    Secure Digital Encryption

    Uploaded by

    deepankan
    50 views12 pages
    This document provides information about secure encryption and public key encryption systems. It discusses how public key encryption works using a public key to encrypt messages that can only be decrypted by the corresponding private key. The key attributes of symmetric versus asymmetric encryption are compared. RSA encryption is described as operating with arithmetic mod n where the encryption and decryption keys allow encoding and decoding messages. Examples are given to illustrate public key encryption.

    Original Description:

    digital Encryption and Cryptography

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information about secure encryption and public key encryption systems. It discusses how public key encryption works using a public key to encrypt messages that can only be decrypted by the corresponding private key. The key attributes of symmetric versus asymmetric encryption are compared. RSA encryption is described as operating with arithmetic mod n where the encryption and decryption keys allow encoding and decoding messages. Examples are given to illustrate public key encryption.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT or read online from Scribd
    Download as ppt
    50 views12 pages

    Secure Digital Encryption

    Uploaded by

    deepankan
    This document provides information about secure encryption and public key encryption systems. It discusses how public key encryption works using a public key to encrypt messages that can only be decrypted by the corresponding private key. The key attributes of symmetric versus asymmetric encryption are compared. RSA encryption is described as operating with arithmetic mod n where the encryption and decryption keys allow encoding and decoding messages. Examples are given to illustrate public key encryption.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT or read online from Scribd
    Download as ppt
    of 12

    SECURE ENCRYTION

    A Digital Data Encryption


    Program
    A word about SE
    one of the strongest encryption tools available

    Encryption is the process whereby codes


    are used to attempt to conceal the meaning
    of a message
    Cryptography is the science of writing
    messages in secret codes . It is about the
    right to privacy, freedom of speech,
    freedom of political association, freedom of
    the press, freedom from unreasonable
    search and seizure, freedom to be left alone
    to promote awareness of the privacy issue
    in a digital age
    How This Method Works??

    This method Your Public Key is


    allows you to used to encrypt a
    message
    send any
    alphabetical data you'll guard your
    Private Key secret
    in numeric form
    from the sender The Private Key is
    to the reciever. used to decrypt
    data that have been
    encrypted using
    your Public Key.
    Public and Private Key encryption

    the message encrypted


    using your Public Key can
    only be decrypted by you,
    the owner of the
    corresponding Private Key
    encryption solves 1of 2
    major problems with older
    methods, namely that you
    had to somehow share the
    key with anyone you
    wanted to be able to read
    (decrypt) your secret
    message
    The second major problem with
    older methods

    Unlike earlier encryption


    methods, the security of
    SE encryption lies entirely
    with the key.
    Key attributes of
    Secret key vs. Public key

    Thousands years use Less than 50 years


    DES RSA
    Fast Slow
    Keys shared Private: concealed
    between usually Public: widely
    only 2 people shared
    128 bit 1,024
    No non-repudiation Nonrepudiation:
    (need 3rd party as Can’t deny having
    witness) sent a message
    Vocabulary, definitions, and acronyms

    Symmetric DES=Data
    encryption Encryption
    Asymmetric Standard
    encryption NSA=National
    Plaintext Security Agency
    Cyphertext Authentication
    Cryptanalyst Man-in-the-middle
    Fi(n)=# positive Trapdoors
    integers <n Key escrow
    relatively prime to n Brute force attack
    Public key encryption systems

    1976: Diffie and Hellman


    Merkle-Hellman Knapsacks
    1978: Rivest-Shamir-Adelman (RSA)
    1984: El gamal and digital signature
    Hash algorithm
    RSA Encryption
    operates with arithmetic mod n
    e=encryption key; d=decryption key
    P=plaintext---> Pe mod n =cyphertext
    (Pe)d mod n = P recovered plaintext
    Encryption and decryption are mutual inverses and
    commutative
    Select large n=pq p & q prime
    Choose e relatively prime to (p-1)(q-1)
    Select d so e*d=1 mod (p-1)(q-1)
    Or e*d=1 mod fi(n) as fi(p)=p-1 for p prime
    Euler-Fermat: x**fi(n)=1mod n for all x relatively
    prime to n
    Example
    Private key Public key
    Super- X 23 Mod 101
    increasing
    sequence
    1 A 23 23
    3 B 69 69
    5 C 115 14
    10 D 230 28
    20 E 460 56
    40 F 920 11
    Public key cryptography is based
    on multiplicative inverses
    Suppose message to encrypt is ABC
    Translate to 23+69+14=106
    106 is sent
    Since 23*22=1 mod 101 the recipient will
    multiply 106x22=2332=9 mod 101
    And infer that the message is ABC since
    9=1+3+5
    An interceptor will spend a long time
    figuring it out.
    THANK YOU

    You might also like