Rough Sets and Intelligent Systems Paradigms

Volume 4585 of the series Lecture Notes in Computer Science pp 622-629

The Diffie–Hellman Problem in Lie Algebras

  • Beata RafalskaAffiliated withUniversity of Warmia and Mazury, Olsztyn

* Final gross prices may vary according to local VAT.

Get Access


Cryptography in its present state relies increasingly on complex mathematical theories, e.g., elliptic curves, group theory, etc. We address in this article the problem of proxy signatures and we set this problem in the framework of Lie algebras. We show how to use a chosen maximal set of differentiable automorphisms in order to carry out the task of proxy signing. We also show possible attacks and the way to protect against them.


cryptography proxy signatures attacks Lie algebras differentiable maps