Author of the publication

Faster ECC over F_2^521-1 F 2 521 - 1 (feat. NEON).

, , , , , , and . ICISC, volume 9558 of Lecture Notes in Computer Science, page 169-181. Springer, (2015)

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.

No persons found for author name Nogami, Yasuyuki
add a person with the name Nogami, Yasuyuki
 

Other publications of authors with the same name

Accelerating Cross Twisted Ate Pairing with Ordinary Pairing Friendly Curve of Composite Order That Has Two Large Prime Factors., , , , and . NBiS, page 552-557. IEEE Computer Society, (2010)A binarization of geometric sequences with Legendre symbol and its autocorrelation., , and . IWSDA, page 28-31. IEEE, (2013)A peer-to-peer communication function among Web browsers for Web-based Volunteer Computing., , , , and . ISCIT, page 383-387. IEEE, (2014)A Comparative Study of Twist Property in KSS Curves of Embedding Degree 16 and 18 from the Implementation Perspective., , , and . J. Inform. and Commun. Convergence Engineering, (2017)Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing., , , and . ICISC, volume 5984 of Lecture Notes in Computer Science, page 47-64. Springer, (2009)A High-Speed Square Root Algorithm in Extension Fields., , , and . ICISC, volume 4296 of Lecture Notes in Computer Science, page 94-106. Springer, (2006)Improved Modular Multiplication for Optimal Prime Fields., , , , and . WISA, volume 8909 of Lecture Notes in Computer Science, page 150-161. Springer, (2014)A Construction of a Keyword Search to Allow Partial Matching with a Block Cipher., , , and . WISA, volume 11402 of Lecture Notes in Computer Science, page 241-252. Springer, (2018)Consideration of Efficient Pairing Applying Two Construction Methods of Extension Fields., , , and . CANDAR Workshops, page 445-451. IEEE Computer Society, (2018)Efficient Optimal Ate Pairing at 128-Bit Security Level., , , , , and . INDOCRYPT, volume 10698 of Lecture Notes in Computer Science, page 186-205. Springer, (2017)