TNFS Resistant Families of Pairing-Friendly Elliptic CurvesFotiadis, Georgios ; in Theoretical Computer Science (2019), 800 Detailed reference viewed: 102 (17 UL) Optimal TNFS-secure pairings on elliptic curves with composite embedding degreeFotiadis, Georgios ; E-print/Working paper (2019) Detailed reference viewed: 92 (4 UL) Optimal TNFS-secure pairings on elliptic curves with even embedding degreeFotiadis, Georgios ; E-print/Working paper (2018) Detailed reference viewed: 56 (8 UL) Generating Pairing-Friendly Elliptic Curve Parameters Using Sparse FamiliesFotiadis, Georgios ; in Journal of Mathematical Cryptology (2018), 12(2), 83-99 Detailed reference viewed: 97 (6 UL) Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple JacobiansFotiadis, Georgios ; in International Conference on Mathematical Aspects of Computer and Information Sciences (2017, December 21) Detailed reference viewed: 109 (5 UL) Constructing Suitable Parameters for Pairing-Based CryptographyFotiadis, Georgios ![]() Doctoral thesis (2017) Detailed reference viewed: 60 (8 UL)![]() Pairing-Friendly Elliptic Curves Resistant to TNFS AttacksFotiadis, Georgios ; Scientific Conference (2017) Detailed reference viewed: 36 (0 UL) More Sparse Families of Pairing-Friendly Elliptic CurvesFotiadis, Georgios ; in International Conference on Cryptology and Network Security, Heraklion 22-24 October 2014 (2014) Detailed reference viewed: 86 (2 UL) On the Efficient Generation of Generalized MNT Elliptic CurvesFotiadis, Georgios ; in 5th International Conference on Algebraic Informatics, Porquerolles 3-6 September 2013 (2013) Detailed reference viewed: 93 (1 UL) Efficient Certification Path Discovery for MANET; ; et al in EURASIP Journal on Wireless Communications and Networking (2010), 2010 Detailed reference viewed: 81 (1 UL) |
||