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 would like to design a hardware-based accelerator for a pairing algorithm to make it faster. I know that I need to do arithmetic over a base and an extension field.

Could anyone would suggest which of the algorithms I have to use for arithmetic over base and extension fields for addition, subtraction and most importantly for multiplication and exponentiation? I am planning to implement “Tate pairing over BN curves”.

The second part of my question is: how to do field extension like from a base field $F_p$ to $F_p^{12}$?

share|improve this question
add comment

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.