Author of the publication

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

, , , and . IWSEC, volume 9836 of Lecture Notes in Computer Science, page 319-334. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Cryptanalysis of the Birational Permutation Signature Scheme over a Non-commutative Ring., and . IACR Cryptology ePrint Archive, (2009)An Efficient F_4 -style Based Algorithm to Solve MQ Problems., , and . IWSEC, volume 11689 of Lecture Notes in Computer Science, page 37-52. Springer, (2019)Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation., , , and . IWSEC, volume 9836 of Lecture Notes in Computer Science, page 319-334. Springer, (2016)The Tate-Lichtenbaum Pairing on a Hyperelliptic Curve via Hyperelliptic Nets., and . Pairing, volume 7708 of Lecture Notes in Computer Science, page 218-233. Springer, (2012)Polynomial selection of F4 for solving the MQ problem., , , and . JSIAM Lett., (2022)An integer factoring algorithm based on elliptic divisibility sequences., , , and . JSIAM Lett., (2012)A technique to reduce memory usage of M4GB algorithm., , , , and . JSIAM Lett., (2023)Polynomial selection for computing Gröbner bases., , , , and . JSIAM Lett., (2021)Non-optimistic Secure Circuit Evaluation Based on ElGamal Encryption and Its Applications., , , , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (1): 128-138 (2007)NZMATH 1.0., , , , and . ICMS, volume 6327 of Lecture Notes in Computer Science, page 260-269. Springer, (2010)