ddwew's profile - activity

I trying to implement alrorithm, and it's one of this step. I'm so sorry, I found that I was doing wrong (I was trying to factor polynomial and didn't notice that initial polynomial was not square free (f here is the factor with degree 2 in initial polynomial), so on one of the steps I'm facing with this). Thank all of you for you support and messages

Please can you explain me how to use quotient ring in this case?

Thank you for reply. Let's say n is around 73 binary digits. GF(P) seems to give the same result - I can't calculate f^n because it's too slow

Hello, I have the following:

p = 1119823

F.<x> = PolynomialRing(Integers(p))

f = F(x^6 + 1119810*x^5 + 60*x^4 + 1119733*x^3 + 1119688*x^2 + 567*x + 1119338)

I have big n and want to calculate f^n but I don't know how I can do It fast in Sage. I know that if I can find order of element f then I can do f^(n % f_order).But I don't know order and how find It in this case. So please explain me how I can calculate f^n fast?