Research ArticleOpen accessIn the keywordsAccelerated Search for Gaussian Generator Based on Triple Prime IntegersBoris S. Verkhovsky, Md Shiblee SadikProblem statement: Modern cryptographic algorithms are based on complexity of two problems: Integer factorization of real integers and a Discrete Logarithm Problem (DLP). Approach: The latter problem is even more complicated in the domain of complex integers, where Public Key Cryptosystems (PKC) had an advantage over analogous encryption-decryption protocols in arithmetic of real integers modulo p: The former PKC have … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,517 accessesView PDFCite
Research ArticleOpen accessIn the abstractFundamental Properties of the Galois CorrespondenceAyinde S. Olukayode, Oyekan E. AbiodunProblem Statement: Let K is the splitting field of a polynomial f(x) over a field F and αn be the roots of f in K. Let G be embedded as a subgroup of the symmetric group ς. We determined the Galois group G, and the subgroup. Approach: computed some auxiliary polynomials that had roots in K, where the permutation of … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 7,292 accessesView PDFCite