2020-01-15 14:53:45 +0200 | received badge | ● Notable Question (source) |

2019-01-07 15:32:03 +0200 | received badge | ● Popular Question (source) |

2016-11-08 12:53:55 +0200 | received badge | ● Student (source) |

2016-11-08 12:53:52 +0200 | received badge | ● Self-Learner (source) |

2016-11-08 12:53:52 +0200 | received badge | ● Teacher (source) |

2016-10-22 18:35:38 +0200 | answered a question | Roots of Polynomial over Finite Field - Characteristic Polynomial If someone is facing the same problem at a point; using gave me the roots in the form I needed! |

2016-10-21 22:02:18 +0200 | asked a question | Roots of Polynomial over Finite Field - Characteristic Polynomial I am currently trying to implement the Pollard Rho Algorithm using the speed-up with automorphisms applied to the Bitcoin curve Secp256k1. Hence I have the elliptic curve $y^2= x^3+7$ over a finite field with order $p$ such that $p\equiv 1 (mod) 6$, and with prime cardinality $l$. Then we have an automorphism $\phi: E \to E$ with $(x,y) \mapsto (\xi_6 x, -y)$. Then there exists an integer $s_\phi$ s.t $\forall P \in E( \mathbb{F_{p}} )$ we have $\phi (P) = s_\phi P$. To find this $s_{\phi}$ we calculate the roots of the characteristic polynomial of $\phi$ modulo $l$. This is the step is where I am working on. I calculate with this example of an elliptic curve over $p = 733387$ with $l = 734443$: $P$ and $Q$ are such that $Q = e * P$ output 164753 which is of order 6 as wanted in $\mathbb{F_{p}}$ Here I am not sure, but I think from the cyclotomic theory the minimal polynomial is $x^5+x^4+x^3+x^2+x+1$ for the primitve $6^{th}$ root of unity in $\mathbb{F_{p}}$ ? since $s_{\phi}$ should be found as a root of the polynomial modulo $l$ I created it in the polynomial ring modulo $l$ here lies my problem. The root that sage outputs are: I tried to check different questions in the forum and saw that the parent of my root is a Symbolic Ring, but I don't know what to do about it. And I can't continue calculating with my possible $s_{\phi}$. And I need my $s_{\phi}$ to continue the steps in the Pollard Rho algorithm. My source for this is the "Handbook of Elliptic and Hyperelliptic Curve Cryptography" section 15.2.1. I would be happy for any advice of maybe different souces that treat this algorithm. |

2016-09-27 14:26:25 +0200 | received badge | ● Popular Question (source) |

2016-09-27 14:26:25 +0200 | received badge | ● Famous Question (source) |

2016-09-27 14:26:25 +0200 | received badge | ● Notable Question (source) |

2013-11-06 19:02:22 +0200 | marked best answer | Three-Pass Protocol While your computations for |

2013-11-06 19:01:57 +0200 | marked best answer | primitive root Can you tell us which error you got (I did not get one for a long time, then i stopped the loop) ? Moreover, in the first pass through the loop (x = 1, p = 2), Also, instead of writing: you can simply write: because Also, you can remove: |

2013-11-06 19:01:57 +0200 | received badge | ● Scholar (source) |

2013-11-06 18:39:29 +0200 | answered a question | primitive root I found my mistake. In the end there was no error, only, that the programm did not give any primitive root. That's because the Must lie inside the first loop. Otherwise it was all the time False if it did not work out once. So the correct version is: |

2013-11-06 18:20:26 +0200 | received badge | ● Editor (source) |

2013-11-06 17:41:16 +0200 | asked a question | primitive root I am writing a program to find the primitive root. In the lecture we have given that So here my programm: But still there is no result. Can anyone help? I don't see the problem. Thanks a lot! |

2013-11-06 17:14:14 +0200 | answered a question | Three-Pass Protocol I found the problem. It was that if I calculated R(Ka^y) it simply should have been K, but it wasn't. So I tried and this way it works and is the same as Kb. And also So I didn't try your suggestion. But thanks a lot for the response!! :) |

2013-11-05 17:46:17 +0200 | asked a question | Three-Pass Protocol I am currently trying to make an example for the three pass protocol. Maybe someone can tell me my mistake, because it doesn't work out. There is no error, but the numbers don't fit.
Thank you and best, Luca |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.