Quasigroups in cryptology
From MaRDI portal
Publication:2268339
zbMath1281.94054arXiv1007.3572MaRDI QIDQ2268339
Publication date: 10 March 2010
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3572
Hamming distancequasigroupcryptology(r,s,t)-quasigroupauthentication of a messageNLPN sequencesecret-sharing systemstream-cipherzero knowledge protocol
Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Loops, quasigroups (20N05) Authentication, digital signatures and secret sharing (94A62)
Related Items (11)
Algorithms for checking some properties of \(n\)-quasigroups ⋮ Generation of proper families of functions ⋮ Proper families of functions and their applications ⋮ Unnamed Item ⋮ Non-associative public-key cryptography ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automata over abstract finite quasigroups ⋮ Automata over finite T-quasigroups ⋮ Hardness of learning loops, monoids, and semirings ⋮ Unnamed Item
This page was built for publication: Quasigroups in cryptology