Gerardo Pelosi | Politecnico di Milano (original) (raw)
Papers by Gerardo Pelosi
2014 International Carnahan Conference on Security Technology (ICCST), 2014
2014 Second International Symposium on Computing and Networking, 2014
2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS), 2014
Proceedings of the 7th International Conference on Security of Information and Networks - SIN '14, 2014
Algorithms and Implementations Using C++, 2014
Information Processing Letters, 2015
2014 International Carnahan Conference on Security Technology (ICCST), 2014
IET Computers & Digital Techniques, 2014
Trusted Computing for Embedded Systems, 2014
Trusted Computing for Embedded Systems, 2014
Proceedings -Design, Automation and Test in Europe, DATE, 2006
Recently, the interest about the Tate pairing over binary fields has decreased due to the existen... more Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of such fields. We show that the choice of fields of large size to make these attacks infeasible does not lead to a degradation of the computation performance of the pairing. We describe
2014 International Carnahan Conference on Security Technology (ICCST), 2014
2014 Second International Symposium on Computing and Networking, 2014
2014 IEEE Intl Conf on High Performance Computing and Communications, 2014 IEEE 6th Intl Symp on Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf on Embedded Software and Syst (HPCC,CSS,ICESS), 2014
Proceedings of the 7th International Conference on Security of Information and Networks - SIN '14, 2014
Algorithms and Implementations Using C++, 2014
Information Processing Letters, 2015
2014 International Carnahan Conference on Security Technology (ICCST), 2014
IET Computers & Digital Techniques, 2014
Trusted Computing for Embedded Systems, 2014
Trusted Computing for Embedded Systems, 2014
Proceedings -Design, Automation and Test in Europe, DATE, 2006
Recently, the interest about the Tate pairing over binary fields has decreased due to the existen... more Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of such fields. We show that the choice of fields of large size to make these attacks infeasible does not lead to a degradation of the computation performance of the pairing. We describe