Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- File Type
Articles 1 - 5 of 5
Full-Text Articles in Algebra
Rsa Algorithm, Evalisbeth Garcia Diazbarriga
Rsa Algorithm, Evalisbeth Garcia Diazbarriga
ATU Research Symposium
I will be presenting about the RSA method in cryptology which is the coding and decoding of messages. My research will focus on proving that the method works and how it is used to communicate secretly.
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
Cybersecurity Undergraduate Research Showcase
The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs
UNO Student Research and Creative Activity Fair
The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.
Now there are three difficulty tiers to POW problems, roughly corresponding to …
The Last Digits Of Infinity (On Tetrations Under Modular Rings), William Stowe
The Last Digits Of Infinity (On Tetrations Under Modular Rings), William Stowe
Celebration of Learning
A tetration is defined as repeated exponentiation. As an example, 2 tetrated 4 times is 2^(2^(2^2)) = 2^16. Tetrated numbers grow rapidly; however, we will see that when tetrating where computations are performed mod n for some positive integer n, there is convergent behavior. We will show that, in general, this convergent behavior will always show up.
Generalizations And Algebraic Structures Of The Grøstl-Based Primitives, Dmitriy Khripkov, Nicholas Lacasse, Bai Lin, Michelle Mastrianni, Liljana Babinkostova (Mentor)
Generalizations And Algebraic Structures Of The Grøstl-Based Primitives, Dmitriy Khripkov, Nicholas Lacasse, Bai Lin, Michelle Mastrianni, Liljana Babinkostova (Mentor)
Idaho Conference on Undergraduate Research
With the large scale proliferation of networked devices ranging from medical implants like pacemakers and insulin pumps, to corporate information assets, secure authentication, data integrity and confidentiality have become some of the central goals for cybersecurity. Cryptographic hash functions have many applications in information security and are commonly used to verify data authenticity. Our research focuses on the study of the properties that dictate the security of a cryptographic hash functions that use Even-Mansour type of ciphers in their underlying structure. In particular, we investigate the algebraic design requirements of the Grøstl hash function and its generalizations. Grøstl is an …