The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets

Wang et al. proposed a method for obtaining elliptic curves with embedding degree 1 for securing critical infrastructures, and presented several elliptic curves generated by their method with torsion points of 160 bits and 189 bits orders. They also presented some experimental results and claimed that their implementation of an elliptic curve generated with their method is faster than an implementation for embedded devices presented by Bertoni et al. In this paper, we point out that the security and efficiency claims given by Wang et al. are flawed. Specifically, we show that it is possible to solve finite field discrete logarithm problems defined over their elliptic curves in practice. On the elliptic curves with torsion points of 160 bits orders generated by Wang et al., their instances of finite field discrete logarithm problems are solved in around 4 hours by using a standard desktop PC. On the torsion points of 189 bits orders, their instances are solved in around 10 days by using two standard desktop PCs. The hardness of the finite field discrete logarithm problems is one of the most important bases of security; therefore, their elliptic curves should not be used for cryptographic purposes.

show abstract

The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets

Cited by 3 publications

References 8 publications

Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation

Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation

Parallel Algorithms on Hyperelliptic Pairings Using Hyperelliptic Nets

Security analysis of elliptic curves with embedding degree 1 proposed in PLOS ONE 2016

Contact Info

Product

Resources

About