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.

It's using Euclidian inverse. Can you show it step by step?

$$N=7, q=11, a = 3+2X^2 -3X^4 +X^6$$

the inverse of $a \pmod {11}$ is

$$A=-2+4X+2X^2 +4X^3 -4X^4 +2X^5 -2X^6$$

How do we compute $A$?

share|improve this question
    
1  
Actually, it is duplicated: crypto.stackexchange.com/questions/6654/… –  cygnusv Mar 26 at 8:48

1 Answer 1

At least it checks out:

$$(3 + 2X^2 - 3X^4 + X^6)(-2 + 4X + 2X^2 + 4X^3 - 4X^4 + 2X^5 - 2X^6) = -6 + X + 6X^2 + X^3 - X^4 + 6X^5 - 6X^6 - 4X^2 + 8X^3 + 4X^4 + 8X^5 - 8X^6 + 4 - 4X + 6X^4 - X^5 - 6X^6 - 1 + X - 6X^2 + 6X^3 - 2X^6 + 4 + 2X + 4X^2 - 4X^3 + 2X^4 - 2X^5 = 1$$ multiplying out all the terms, using $X^7 = 1, X^8 = X, X^9 = X^2$ etc. and the fact that all coefficients are taken mod 11.

In this answer by some NTRU person you will find the algorithm to find it. Try and follow that.

share|improve this answer

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.