Abstract
We develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).
Original language | English (US) |
---|---|
Pages (from-to) | 31-54 |
Number of pages | 24 |
Journal | Groups, Complexity, Cryptology |
Volume | 9 |
Issue number | 1 |
DOIs | |
State | Published - May 1 2017 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics