Publication at Faculty of Mathematics and Physics, Faculty of Education |
2011
Abstract
Congruence-simple algebras form the basic building block of algebra for construction of more complex structures. However, their role in the use of algebraic structures in cryptology where they are used primarily for modification of DiffieHellman algorithm is fundamental.
It is undoubtedly very interesting in this context that in contrast to simple groups and areas that have piqued special interest of mathematicians for decades, we only very rarely come across results of studies in congruence-simple semirings. The aim of this article is to summarize the results achieved in the area of finite congruence-simple semirings over the past decade and to pinpoint the open questions that are yet to be answered.