Latin quandles and applications to cryptography

Jaiyeola, Temitope Gbolahan; Adeniran, John Olushola; Isere, A. O.

doi:10.13164/ma.2021.04

Cited by 2 publications

(1 citation statement)

References 14 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results on the holomorph of left and right key laws were shown by Ogunrinade et al [24] to be applicable to symmetric cryptography (secret key cryptosystem) while Isere et al [5] built cipher algorithms for cryptography in some peculiar circumstances using some quasi-Latin quandles.…”

Section: Theorem 25 (See [21])mentioning

confidence: 99%

On the universality and isotopy-isomorphy of (r,s,t)-inverse quasigroups and loops with applications to cryptography

Ilemobade,

George,

Gbolahan

2023

QRS

View full text Add to dashboard Cite

This paper introduced a condition called $\mathcal{R}$-condition under which $(r,s,t)$-inverse quasigroups are universal. Middle isotopic $(r,s,t)$-inverse loops, satisfying the $\mathcal{R}$-condition and possessing a trivial set of $r$-weak inverse permutations were shown to be isomorphic; isotopy-isomorphy for $(r,s,t)$-inverse loops. Isotopy-isomorphy for $(r,s,t)$-inverse loops was generally characterized. With the $\mathcal{R}$-condition, it was shown that for positive integers $r$, $s$ and $t$, if there is a $(r,s,t)$-inverse quasigroup of order $3k$ with an inverse-cycle of length $gcd(k,r+s+t)>1$, then there exists an $(r,s,t)$-inverse quasigroup of order $3k$ with an inverse-cycle of length $gcd\big(k(r+s+t), (r+s+t)^2\big)$. The procedure of application of such $(r,s,t)$-inverse quasigroups to cryptography was described and explained, while the feasibility of such $(r,s,t)$-inverse quasigroups was illustrated with sample values of $k,r,s$ and $t$.

show abstract

Section: Theorem 25 (See [21])mentioning

confidence: 99%