Improving Miller’s Algorithm Using the NAF and the Window NAF

2013 ◽  
pp. 279-283
Author(s):  
Siham Ezzouak ◽  
Mohammed El Amrani ◽  
Abdelmalek Azizi
Keyword(s):  
Miller’S Algorithm

Further refinement of pairing computation based on Miller’s algorithm

2007 ◽  
Vol 189 (1) ◽  
pp. 395-409 ◽  
Author(s):  
Chao-Liang Liu ◽  
Gwoboa Horng ◽  
Te-Yu Chen
Keyword(s):  
Miller’S Algorithm ◽  
Pairing Computation

scholarly journals Isotopy of latin squares in cryptography

2010 ◽  
Vol 45 (1) ◽  
pp. 27-36 ◽  
Author(s):  
Otokar Grošek ◽  
Marek Sýs
Keyword(s):  
Decision Problem ◽  
Latin Squares ◽  
Practical Application ◽  
Zero Knowledge ◽  
Miller’S Algorithm

ABSTRACT We present a new algorithm for a decision problem if two Latin squares are isotopic. Our modification has the same complexity as Miller’s algorithm, but in many practical situations is much faster. Based on our results we study also a zero-knowledge protocol suggested in [3]. From our results it follows that there are some problems in practical application of this protocol.

Two Improvements of Twisted Ate Pairing with Barreto-Naehrig Curve by Dividing Miller's Algorithm

2010 ◽  
Vol 2 (4) ◽  
pp. 1-13
Author(s):  
Yumi Sakemi ◽  
Hidehiro Kato ◽  
Shoichi Takeuchi ◽  
Yasuyuki Nogami ◽  
Yoshitaka Morikawa
Keyword(s):  
Ate Pairing ◽  
Miller’S Algorithm

Improved Miller’s Algorithm for Computing Pairings on Edwards Curves

2014 ◽  
Vol 63 (10) ◽  
pp. 2626-2632 ◽  
Author(s):  
Duc-Phong Le ◽  
Chik How Tan
Keyword(s):  
Edwards Curves ◽  
Miller’S Algorithm

scholarly journals An extension of Miller's algorithm

1968 ◽  
Vol 13 (2) ◽  
pp. 174-176
Author(s):  
Frank William John Olver
Keyword(s):  
Miller’S Algorithm

scholarly journals Optimizing the computing of pairing with Miller's algorithm

2014 ◽  
Vol 8 (4) ◽  
pp. 171-182
Author(s):  
Siham Ezzouak ◽  
Mohammed El Amrani ◽  
Abdelmalek Azizi
Keyword(s):  
Miller’S Algorithm
Sign in / Sign up

Export Citation Format

Share Document