Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Algebra
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna
Senior Honors Theses
The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
George K. Thiruvathukal
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Computer Science: Faculty Publications and Other Works
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Building An Algebraic Representation Of The Aes In Sage, Thomas Gagne
Building An Algebraic Representation Of The Aes In Sage, Thomas Gagne
Summer Research
First developed in 2001, the Advanced Encryption Standard (AES) cipher is now one of the most commonly used encryption algorithms worldwide. However, the algebraically simple description of the AES leads some cryptographers to question whether an algebraic weakness in the cipher exists, which would be fatal to the security of the AES. This summer, I studied the algebraic properties of the AES with the goal of designing a computational tool for researchers and algebraic cryptanalysts of the AES which would allow more rigorous study of the algebraic qualities of the AES. I accomplished this by implementing an algebraic representation of …
Presenting Distributive Laws, Marcello M. Bonsangue, Helle H. Hansen, Alexander Kurz, Jurriaan Rot
Presenting Distributive Laws, Marcello M. Bonsangue, Helle H. Hansen, Alexander Kurz, Jurriaan Rot
Engineering Faculty Articles and Research
Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond to simple natural transformations. However, when T is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation …