Thumbnail Image
Publication

A New Asymmetric Encryption Algorithm Involving Both Group And Number Theory: Derivation Of The Lucente Stabile Atkins Cryptosystem Using Gauss’s Generalization Of Wilson’s Theorem

Lucente Stabile, Francesco
; 
Lucente Stabile, Francesco
; 
Atkins, Carey
; 
Atkins, Carey
; 
Rosenthal, Arthur James
; 
Rosenthal, Arthur James
    Title
    A New Asymmetric Encryption Algorithm Involving Both Group And Number Theory: Derivation Of The Lucente Stabile Atkins Cryptosystem Using Gauss’s Generalization Of Wilson’s Theorem
    Date
    2020-05-04
    Subject
    Cryptography
    Mathematics
    Encryption Algorithm
    New Algorithms
    Abstract Algebra
    Number Theory
    Material type
    Collections
    Graduate & Faculty Presentations
    Show all metadata
    Files
    1-LucenteStabileFrancesco_3_Cr.mp4
    MP4, 298.92 MB
    2-LucenteStabileFrancesco_4_Ex.mp4
    MP4, 149.54 MB
    3-LucenteStabileFrancesco_5_Be.mp4
    MP4, 120.48 MB
    Thumbnail Image
    0-LucenteStabileFrancesco_2_Ex.pdf
    Adobe PDF, 147.12 KB
    Thumbnail Image
    LucenteStabileFrancesco_1.pdf
    Adobe PDF, 161.82 KB
    URI
    http://hdl.handle.net/20.500.13013/1389
    Abstract
    Our research led to the discovery of an asymmetric encryption algorithm that follows Kerckhoff's principle and relies on a specific case of Gauss's Generalization of Wilson's Theorem. Unlike prime factorization based algorithms, the eavesdropping cryptanalyst has no indication that he has successfully decrypted the cyphertext. For this reason, we aim to show that this algorithm is not only more secure than existing asymmetric algorithms, but it has the potential to be significantly computationally faster.
    Duration
    Location
    Advisor
    Sponsor
    Rosenthal, Arthur James
    Course
    Department
    Degree
    Source
    Publisher
    Research Projects
    Organizational Units
    Journal Issue
    Embedded videos