Scribd Logo
Upload

Welcome to Scribd!

  • 71 views

    Encryption and Decryption Using Laplace Transform

    Uploaded by

    Satyam singhal
    This document describes a proposal for using the Laplace transform method for encryption and decryption. It introduces representing text as numerical values and using the Laplace transform to encrypt and the inverse Laplace transform to decrypt. The methodology section outlines the steps of taking plaintext as input, applying the Laplace transform with a series expansion and key, then the inverse transform to obtain the output ciphertext. It also includes parameter specifications, a table assigning numbers to letters, and formulas for the Laplace transform. The proposed work section demonstrates encrypting a sample message and generalizes the approach. It is concluded that this provides a contemporary encryption technique that would be difficult to attack.

    Copyright:

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

    Encryption and Decryption Using Laplace Transform

    Uploaded by

    Satyam singhal
    71 views19 pages
    This document describes a proposal for using the Laplace transform method for encryption and decryption. It introduces representing text as numerical values and using the Laplace transform to encrypt and the inverse Laplace transform to decrypt. The methodology section outlines the steps of taking plaintext as input, applying the Laplace transform with a series expansion and key, then the inverse transform to obtain the output ciphertext. It also includes parameter specifications, a table assigning numbers to letters, and formulas for the Laplace transform. The proposed work section demonstrates encrypting a sample message and generalizes the approach. It is concluded that this provides a contemporary encryption technique that would be difficult to attack.

    Original Title

    Maths Project Tanisha Singhal 14

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes a proposal for using the Laplace transform method for encryption and decryption. It introduces representing text as numerical values and using the Laplace transform to encrypt and the inverse Laplace transform to decrypt. The methodology section outlines the steps of taking plaintext as input, applying the Laplace transform with a series expansion and key, then the inverse transform to obtain the output ciphertext. It also includes parameter specifications, a table assigning numbers to letters, and formulas for the Laplace transform. The proposed work section demonstrates encrypting a sample message and generalizes the approach. It is concluded that this provides a contemporary encryption technique that would be difficult to attack.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    71 views19 pages

    Encryption and Decryption Using Laplace Transform

    Uploaded by

    Satyam singhal
    This document describes a proposal for using the Laplace transform method for encryption and decryption. It introduces representing text as numerical values and using the Laplace transform to encrypt and the inverse Laplace transform to decrypt. The methodology section outlines the steps of taking plaintext as input, applying the Laplace transform with a series expansion and key, then the inverse transform to obtain the output ciphertext. It also includes parameter specifications, a table assigning numbers to letters, and formulas for the Laplace transform. The proposed work section demonstrates encrypting a sample message and generalizes the approach. It is concluded that this provides a contemporary encryption technique that would be difficult to attack.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 19

    eeeed

    “ ENCRYPTION AND DECRYPTION USING LAPLACE


    TRANSFORM”

    A PROPOSAL OF INNOVATIVE WORK


    (MTE Component Evaluation)

    Submitted by:
    TANISHA SINGHAL
    2K20/A5/14

    Submitted to:
    VIVEK AGGARWAL AND RUCHIKA LOCHAB

    DEPARTMENT OF APPLIED MATHEMATICS, DELHI


    TECHNOLOGICAL UNIVERSITY, BAWANA ROAD, NEW
    DELHI-110042

    APPLIED MATHEMATICS
    eeeed

    DELHI TECHNOLOGICAL UNIVERSITY


    (FORMERLY Delhi College of Engineering)
    Bawana Road, Delhi-110042

    CANDIDATE'S DECLARATION

    I, TANISHA SINGHAL (2K20/A5/14), student of B. Tech. at this


    moment, declare that the project Dissertation titled
    “ENCRYPTION AND DECRYPTION USING LAPLACE
    TRANSFORM, " submitted by us in partial fulfilment of the
    requirement for the middle term evaluation of Bachelor of
    Technology, are correct and have been taken references from different
    sources.

    Place: Delhi Date:15/JULY/2021

    Name-TANISHA SINGHAL (2K20/A5/14)

    APPLIED MATHEMATICS
    DELHI TECHNOLOGICAL UNIVERSITY
    eeeed

    (FORMERLY Delhi College of Engineering)


    Bawana Road, Delhi-110042

    ACKNOWLEDGEMENT

    I needed the assistance and guidance of some respected individuals in


    order to complete our core objective, and they deserve our deepest
    gratitude. We are overjoyed at the conclusion of this job. I want to
    show our gratitude to VIVEK AGGARWAL AND RUCHIKA
    LOCHAB Mentor for a significant project. Throughout several talks,
    we are providing us with a suitable guideline for reporting. We'd also
    like to express our heartfelt gratitude to everyone who has helped us
    write this assignment, both directly and indirectly.

    Moreover, I am thanking the Department of Applied Mathematics,


    Delhi Technological University, to work on this topic.

    DELHI TECHNOLOGICAL UNIVERSITY


    (FORMERLY Delhi College of Engineering)
    Bawana Road, Delhi-110042
    eeeed

    CERTIFICATE

    I, at this moment, certify that the project title.


    “ENCRYPTION AND DECRYPTION USING LAPLACE
    TRANSFORM” This document, which was submitted by
    TANISHA SINGHAL (2K20/A5/14) of Delhi Technological
    University, Delhi in full fulfilment of the need for the award of MTE
    evaluation of Second Semester of Bachelor Of Technology, is a
    record of the project work completed by students under my
    supervision.

    Place: Delhi Date:15/JULY/2021

    VIVEK AGGARWAL
    RUCHIKA LOCHAB
    (MENTOR)

    ABSTRACT
    eeeed

    Using appropriate expansion and transformation, this study will


    investigate the mathematical analysis for contemporary cryptography.
    Cryptography is an area of mathematics that deals with the detection
    and protection of data. This is mainly accomplished through the
    utilization of cryptography algorithms. Cryptography is mainly done
    by Laplace transformation method. For encryption, the same Laplace
    transform is used, and for decryption, the inverse is used. Adoption of
    this method achieves the majority of cryptography propaganda, i.e.
    safeguarded knowledge transmission. In today's world, there is an
    excessive use of computers and network systems, which necessitates
    that clients or users bear in mind minimum requirements. Because
    these networks are frequently open and accessible from anyone, they
    provide mind-blowing information. This demonstrates the necessity
    for a system to secure the information from being misused.
    Cryptography is the name of the technology. This cryptography is
    used in a variety of settings, including the army, hospitals, and
    security. The consequences of ignoring encryption are unimaginable,
    as it leads to data misuse by unwelcome parties.

    HOW DOES IT WORK?

    Initialization
    eeeed

    Encryption

    Decryption

    Finalization

    INITIALIZATION
    eeeed

    The phase includes the intake of knowledge or message to be


    protected or encrypted. This message is converted to a corresponding
    numerical value assigned to it.

    ENCRYPTION

    It is the phase where the sign message is encoded into protected


    against. The initialization and encryption stages correspond to the
    transmission stage.

    DECRYPTION

    This phase decodes the encrypted or decrypted message by adopting


    the proposed technique. The ultimate phase is the transmission of
    decrypted messages to the client. The phases are executed at receiving
    end. The Laplace transform is transform applied for the conversion of
    your time-domain to the complex frequency domain. This method is
    adopted in our proposal to encrypt and decrypt the info by using usual
    Mathematics. The Laplace transform is given by

    The proposed method is anticipated and located better than usual


    techniques and mentioned in various papers. The proposed method
    uses series expansion, so for various information or the importance or
    the priority of the message, the series will be varied for better
    encryption, and therefore the same is evaluated for decryption.
    eeeed

    METHODOLOGY

    PLAIN TEXT
    eeeed

    LAPLACE
    SERIES
    TRANSFORM

    INVERSE
    LAPLACE SERIES
    TRANSFORM

    OUTPUT

    PARAMETERS SPECIFICATIONS (TABLE-1)


    eeeed

    NUMERICAL ASSIGNMENT OF LETTERS (TABLE-2)

    SOME STANDARD FORMULAS OF LAPLACE TRANSFORM


    eeeed

    PROPOSED WORK
    eeeed

    Allocating 0 to A and 1 to B, then Z will be 25.

    Let the given message (plaintext) be 'PROFESSOR' equals to

    G 0=15

    G 1=17

    G 2=14
    eeeed

    G 3=5

    G 4 =4

    G 5=18

    G 6=18

    G 7=14

    G 8=17

    G n=0

    for n ≥ 9

    Let us consider

    2t ( 2 t )2 ( 2 t )3 ( 2t )4 ( 2 t )5 ( 2t )6 ( 2t )7 ( 2t )8
    ¿ t [15.1+17. +14. +5. +4. +18. + 18. +14. +17. ]
    1! 2! 3! 4! 5! 6! 7! 8!

    ∞
    Gn 2n t n+1
    ¿∑
    n=0 n!

    Taking Laplace to transform on both sides, we have


    eeeed
    eeeed
    eeeed

    DECRYPTION
    eeeed

    GENERALIZATION

    For encryption of given message in terms of Gi we consider f t() =


    Gtert , r ∈ N( set of natural numbers).
    Taking Laplace transform then we can convert the given message Gi
    to G'i
    where
    Gi ' = G ri i (i +1) mod 26 = qi mod 26 where qi = G ri (i +1) i
    = 0,1,2,3, … with key
    eeeed

    CONCLUSION

    The proposed work introduces a new cryptography approach based on


    Laplace transforms and a key that is multiples of mod n. As a result,
    any attack on the key will be difficult to detect.

    As a result of the aforementioned finding, we developed a


    contemporary technique of encrypting and decrypting our sensitive
    data to prevent it from being stolen or abused by hackers.
    eeeed

    REFERENCES

     Barr T.H. – Cryptography, Prentice-Hall, 2002.

     Grewal B.S. – Engineering Mathematics, Khanna Pub. Delhi,


    2005.

     Lerma M. A. Arithmetic,
    http//www.math.northwestern.edu/mlerma/proble m solving
    /results/ modular arith.pdf.

     Stallings W. – Cryptography, 4th edition, Prentice-Hall, 2005.

    THANK YOU

    You might also like