Algebraic Lightweight Cryptography

To reduce the dependence of cyber-security on a small number of problems, it is desirable to also have candidate problems of substantially different types. On the practical side, this would make it easier to tailor optimal implementations in constrained environments, such as RFID tags, that are more suitable for Internet of Things (IoT) applications.

 

Recently, some candidates for lightweight cryptographic primitives, based on nonabelian structures, begin to stand out as potentially secure. We will consider practical aspects of their security and efficiency.