Thesis supervisor: Péter Kutas
Location of studies (in Hungarian): ELTE, Faculty of Informatics Abbreviation of location of studies: ELTE
Description of the research topic:
Learning With Errors (LWE) is a well-known hard problem in lattice-based cryptography which naturally relates tot he closest vector problem (CVP) in euclidean lattices. One often considers structured variants of LWE (Module-LWE,Ring-LWE) whenever the underlying lattice has some extra properties (the lattice is either a module or a ring). Structured variants are highly important as they enable much more efficient and compact schemes. Recently Grover, Mendelsohn, Ling and Vehkalahti proposed to use versions of LWE where the underlying lattice is a non-commutative ring (in particular an order in a cyclic algebra). The task would be study this proposal (and its variants) by generalizing known attacks on Ring-LWE to the non-commutative setting.
Required language skills: angol Further requirements: Basic knowledge of abstract algebra
Number of students who can be accepted: 1
Deadline for application: 2024-05-31
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
