Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Another Two Cryptographic Identities In Universal Osborn Loops

Published 5 Sep 2020 in math.GR | (2009.03676v1)

Abstract: In this study, by establishing an identity for universal Osborn loops, two other identities(of degrees 4 and 6) are deduced from it and they are recognized and recommended for cryptography in a similar spirit in which the cross inverse property(of degree 2) has been used by Keedwell following the fact that it was observed that universal Osborn loops that do not have the 3-power associative property or weaker forms of; inverse property, power associativity and diassociativity to mention a few, will have cycles(even long ones). These identities are found to be cryptographic in nature for universal Osborn loops and thereby called cryptographic identities. They were also found applicable to security patterns, arrangements and networks which the CIP may not be applicable to.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.