Latin quandles and applications to cryptography

Simple item page
dc.contributor.authorIsere, Abednego Orobosa
dc.contributor.authorAdéníran, John Olúsolá
dc.contributor.authorJaiyéolá, Temitópé Gbóláhán
dc.coverage.issue1cs
dc.coverage.volume10cs
dc.date.accessioned2021-07-02T06:09:13Z
dc.date.available2021-07-02T06:09:13Z
dc.date.issued2021cs
dc.description.abstractThis work investigated some properties of Latin quandles that are ap-plicable in cryptography. Four distinct cores of an Osborn loop (non-diassociativeand non-power associative) were introduced and investigated. The necessary andsufficient conditions for these cores to be (i) (left) quandles (ii) involutory quandles(iii) quasi-Latin quandles and (iv) involutory quasi-Latin quandles were established.These conditions were judiciously used to build cipher algorithms for cryptographyin some peculiar circumstances.en
dc.formattextcs
dc.format.extent37-53cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationMathematics for Applications. 2021 vol. 10, č. 1, s. 37-53. ISSN 1805-3629cs
dc.identifier.doi10.13164/ma.2021.04en
dc.identifier.issn1805-3629
dc.identifier.urihttp://hdl.handle.net/11012/200373
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.relation.ispartofMathematics for Applicationsen
dc.relation.urihttp://ma.fme.vutbr.cz/archiv/10_1/ma_10_1_isere_et_al_final.pdfcs
dc.rights© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.rights.accessopenAccessen
dc.titleLatin quandles and applications to cryptographyen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.departmentÚstav matematikycs
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ma_10_1_isere_et_al_final.pdf
Size:
730.69 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
2021/1