Hardness of Learning Problems over Burnside Groups of Exponent 3

In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. In particular, we study the $B_n$-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-reducibility property for $B_n$-LHN. Along the way, we also prove a sequence of lemmas regarding homomorphisms of free Burnside groups of exponent 3 that may be of independent interest

Generalized Learning Problems and Applications to Non-commutative Cryptography

Abstract. 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 spe-cial cases, but is much more general. It allows, for example, instantiations based on non-abelian groups, resulting in a new avenue for the applica-tion 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

Материалы конференции: "Алгебра и математическая логика: теория и приложения"

Сборник содержит тезисы докладов, представленных на международную конференцию "Алгебра и математическая логика: теория и приложения" ( г. Казань 2-6 июня 2014 год) и сопутствующую молодежную летнюю школу "Вычислимость и вычислимые структуры", посвященную 210-летию Казанского университета, 80-летию со дня основания кафедры алгебры (ныне кафедры алгебры и математической логики) Казанского университета Н.Г. Чеботаревым и 70-летию со дня рождения зав. кафедрой члена-корреспондента АН РТ М.М. Арсланова.17

Fast Construction of Relational Features for Machine Learning

Katedra kybernetik

Glosarium Matematika

273 p.; 24 cm