Abstract
DSP-128 is a new multithreaded stream cipher based on the intractability of the Discrete Logarithm Problem (DLP) with key size of 128-bit. The design of DSP-128 is divided into three stages: Initialization Stage, Keystream Generation Stage, and Encryption Stage. The design goal of DSP-128 is to come up with a secure stream cipher with good performance for data encryption. The experimental results show that the encryption rate of DSP-128 is one time slower (running on single processor) than the widely adapted stream cipher RC4, with a higher level of security against possible cryptanalysis attacks. However, because of its multithreaded nature, DSP-128 can take the speed up advantage of multi-core processor architectures which are available widely.
Highlights
Cryptography, in modern times, is an intersection branch between Computer Science and Mathematics
The work presented in this paper is introducing a novel work by providing a multithreaded stream cipher based on Discrete Logarithm Problem (DLP) which is a mathematical Non-deterministic Polynomial (NP)-hard problem [2]
In this paper we present a new stream cipher known as DSP-128, based on the intractability of the Discrete Logarithm Problem (DLP)
Summary
Cryptography, in modern times, is an intersection branch between Computer Science and Mathematics. The work presented in this paper is introducing a novel work by providing a multithreaded stream cipher based on DLP which is a mathematical Non-deterministic Polynomial (NP)-hard problem [2]. The idea behind our proposed stream cipher is based on the intractability of solving the DLP founded on polynomial arithmetic.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
