Cryptography & Graphs

• Computational aspects of elliptic and hyperelliptic curves.


• Cryptography in computationally restricted devices.


• Secure electronic voting.


• Privacy-preserving social network data analysis.


• Extremal (di) graphs and eccentric (di) graphs.

   During the last decade, industry has been paying a lot of attention to the development of smart cards and RFID (Radio Frequency Identification) technologies, being used in many e-commerce and financial applications (such as credit cards, SIMs for mobile phones, access control cards, labelling in department stores, inclusion in electronic passports or even in banknotes,...).

   In both cases, the computational capabilities of these devices are limited. Our research in this area is focused on the study of cryptographic algorithms which fit the features of these environments, such as computational restrictions, reduced memory capacity and bandwidth. Elliptic curve cryptography turns out to be a good alternative to conventional cryptography, since the usage of smaller fields can provide cryptographic solutions which fit better these restrictions.