2011 | OriginalPaper | Buchkapitel
Generalized Learning Problems and Applications to Non-commutative Cryptography
(Extended Abstract)
verfasst von : Gilbert Baumslag, Nelly Fazio, Antonio R. Nicolosi, Vladimir Shpilrain, William E. Skeith III
Erschienen in: Provable Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a generalization of the
learning parity with noise
(LPN) and
learning with errors
(LWE) problems to an abstract class of group-theoretic learning problems that we term
learning homomorphisms with noise
(LHN). This class of problems contains LPN and LWE as special cases, but is much more general. It allows, for example, instantiations based on non-abelian groups, resulting in a new avenue for the application of combinatorial group theory to the development of cryptographic primitives. We then study a particular instantiation using relatively free groups and construct a symmetric cryptosystem based upon it.