| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 200 1 |
| Ultima descărcare din IBN: 2023-10-09 13:35 |
| Căutarea după subiecte similare conform CZU |
| 512.55 (75) |
| Algebră (410) |
 SM ISO690:2012ILEMOBADE, Richard, OLUFEMI OLAKUNLE, George , JAIYEOLA, Temitope Gbolahan. On the universality and isotopy-isomorphy of (r; s; t)-inverse quasigroups and loops with applications to cryptography. In: Quasigroups and Related Systems, 2023, vol. 31, nr. 1, pp. 53-64. ISSN 1561-2848. DOI: https://doi.org/10.56415/qrs.v31.04 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Quasigroups and Related Systems |
||||||
| Volumul 31, Numărul 1 / 2023 / ISSN 1561-2848 | ||||||
|
||||||
| DOI:https://doi.org/10.56415/qrs.v31.04 | ||||||
| CZU: 512.55 | ||||||
| MSC 2010: 20N02, 20N05. | ||||||
| Pag. 53-64 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
This paper introduced a condition called R-condition under which (r; s; t)inverse quasigroups are universal. Middle isotopic (r; s; t)-inverse loops, satisfying the 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 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 ( k(r + s + t); (r + s + t)2 . 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. |
||||||
| Cuvinte-cheie weak inverse, cross inverse, m-inverse, (r, s, t)-inverse quasigroups and loops, R-condition, isotopy-isomorphy, long inverse cycle, cryptography |
||||||
|
|
|
|
