Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

I am working on Efficient Construction of Pairings which are being realized by Miller's algorithm. In this algorithm the basic steps are

  1. point doubling and line function computation
  2. point addition and line function computation, and last one is
  3. exponentiation.

I know Point doubling and point addition steps because these are similar to standard ECC operations, but confused in line function computation. Why do we need this line function and how can I compute it?

share|improve this question
3  
Whichever source you are using to read about Miller's algorithm should also cover the line function... If not, you can of course always read the original source. –  fkraiem May 30 at 13:56

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.