Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Algebra
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 …
A Note On The Degree Of Approximation With An Optimal, Discrete Polynomial, J. J. Swetits, B. Wood
A Note On The Degree Of Approximation With An Optimal, Discrete Polynomial, J. J. Swetits, B. Wood
Mathematics & Statistics Faculty Publications
A saturation theorem and an asymptotic theorem are proved for an optimal, discrete, positive algebraic polynomial operator. The operator is based on the Gauss-Legendre quadrature formula.
Approximation By Discrete Operators, J. J. Swetits, B. Wood
Approximation By Discrete Operators, J. J. Swetits, B. Wood
Mathematics & Statistics Faculty Publications
A discrete, positive, weighted algebraic polynomial operator which is based on Gaussian quadrature is constructed. The operator is shown to satisfy the Jackson estimate and an optimal version is obtained.