20191012 15:19:16 0600  received badge  ● Notable Question (source) 
20190907 06:45:13 0600  received badge  ● Popular Question (source) 
20190906 05:04:41 0600  received badge  ● Popular Question (source) 
20190808 02:10:29 0600  commented question  the following codes for 2^3 field. for the same field how to check the curve parameter A,B are the element of the field what is the sage command to check A and B belongs to the field F. 
20190806 23:23:51 0600  asked a question  which function give accurate time result timeit or start time to end time timeit() or start time to end time 
20190805 02:28:17 0600  asked a question  the following codes for 2^3 field. for the same field how to check the curve parameter A,B are the element of the field . 
20190805 02:15:29 0600  commented question  how to check element A and B are field element? for following code 
20190804 09:22:00 0600  asked a question  how to check element A and B are field element? for following code `p=(2^131) p1=GF(p) F1.<x>=GF(2)[] F.=GF(2^3,'a',modulus=x^3+x+1);F.modulus();F for i,x in enumerate(F): print("{} {}".format(i, x)) A=a^2+a;A B=a+1 E = EllipticCurve(F, (1,A,0,0,B));` 
20190804 00:13:57 0600  asked a question  how to check the element is field element
how to check the element B is Field element, the command which i have written gave me attribute error. 
20190802 05:51:15 0600  asked a question  characteristics three field elliptic curve lliptic curve for characteristics three field How to generate elliptic curve from the following code as Elliptic Curve defined by $y^2 = x^3 + x^2 + 1$ over Finite Field in $a$ of size $3^{151}$ 
20190801 05:39:15 0600  commented question  point tripling over characteristics three field not getting proper result Paper: Efficient Arithmetic on Elliptic Curves over Fields of Characteristics three 
20190801 03:43:49 0600  asked a question  point tripling over characteristics three field not getting proper result import time p=(3^151) after executing the code the error is point are not on the curve. I have written the equation for x3 and y3 by different ways. 
20190702 01:21:02 0600  asked a question  computation time I using timtit command to compute time the result is 625 loops, best of 3: 38.1 ns per loop what is the meaning of 625 loops, best of 3. 
20190609 09:56:26 0600  asked a question  roots of third degree polynomial roots of polynomial x^3+7x+25 over field F(37) 
20190609 00:17:00 0600  asked a question  roots of polynomial f= z^3 + (3a + 4)z^2 + 3z + 3a + 2 # z is variable f1=f.roots() [(3a + 1, 1), (2a, 2)]# what is 1 and 2 represent in the bracket 
20190507 06:14:26 0600  received badge  ● Notable Question (source) 
20190507 06:14:26 0600  received badge  ● Famous Question (source) 
20181225 00:01:12 0600  received badge  ● Popular Question (source) 
20180906 10:16:19 0600  asked a question  Scalar Multiplication over extension field I want to perform scalar multiplication but when i will take some random point and order of that point as scalar it gives me error. 
20180813 01:16:29 0600  asked a question  Elliptic curve secp224r1 p=2^2242^96+1 A=3#(0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFFFFFFFFE) B=(0xB4050A850C04B3ABF541325650440B7D7BFD8BA270B39432355FFB4) F=GF(p) E = EllipticCurve( F, [A,B] );E G=E(0xb70e0cbd6bb4bf7f321390b94a03c1d356c21122343280d6115c1d21,0xbd376388b5f723fb4c22dfe6cd4375a05a07476444d5819985007e34);G the above domain parameter (p,A,B,G) taken from SEC2(standard for efficient cryptography) Recommended Elliptic curve. But when i run the code the error is the point G coordinate do not define point on elliptic curve. 
20180723 09:19:18 0600  asked a question  Elliptic curve arithmetic the below code is performed mod arithmetic of two polynomial fE and fL over prime field P= 5 and the extension is 5^2. the mod of two polynomial is always third degree polynomial. My fE polynomial is always 3p degree and fL polynomial is p degree. my question is whatever p(large p = 112 bit ,128 bit 160 bit) I will take my mod is always third degree. is it because of any polynomial property. p=5 A=4 B=4 print"\n p=",p print"\n A=",A print"\n B=",B F = GF(p) E = EllipticCurve( F, [A,B] );E S. = PolynomialRing( F ) K. = GF( p**2);#K.modulus#, modulus=W^2+W+1 ) print "\n Modulus of K is =", K.modulus() R.<z> = PolynomialRing( K, sparse=True ) fE=z^15 + (4a + 4)z^11 + 2z^10 + (a + 3)z^7 + z^6 + (2a + 2)z^5 + z^3 + 2z^2 + (3a + 4)z + 1 fL=(4az^5 + (a + 4)z + 3);fL f1= (fE%fL).monic;f1 z^3 + (3a + 4)z^2 + 3z + 3a + 2 
20180723 09:18:16 0600  asked a question  Elliptic curve arithmetic the below code is performed mod arithmetic of two polynomial fE and fL over prime field P= 5 and the extension is 5^2. the mod of two polynomial is always third degree polynomial. My fE polynomial is always 3p degree and fL polynomial is p degree. my question is whatever p(large p = 112 bit ,128 bit 160 bit) I will take my mod is always third degree. is it because of any polynomial property. 
20180711 23:17:29 0600  asked a question  computation time why the computation time required in the following way of execution is different. 1.to run the algorithm I am writing the code /algorithm directly on the sage terminal window and execute the code.

20180707 04:32:49 0600  received badge  ● Popular Question (source) 
20180704 02:23:26 0600  asked a question  how to use NTL library for huge polynomial gcd’s over finite fields very quickly). how to use NTL library for huge polynomial gcd’s over finite fields very quickly. 
20180701 06:53:42 0600  asked a question  gcd computation of two polynomial the following code for gcd computation for two polynomials . the code for 112bit elliptic curve but as the polynomials are two large it is difficult to compute gcd. the codes are given below. what is the solution for large polynomials. 
20180628 10:18:37 0600  received badge  ● Popular Question (source) 
20180620 03:24:53 0600  asked a question  computational time i am using two platforms to run the code. one is sagemath cloud and second is sagemath terminal. the computational time obtained in both the platform is different. the results obtained are better in sagemath terminal. i am writing paper so please suggest me which result i have to consider for my research paper. 
20180507 03:16:08 0600  commented question  alternate function/algorithm for MOD operation the time required for above compution is 1.96ms and i want 0.19 ms. 
20180506 11:40:39 0600  asked a question  alternate function/algorithm for MOD operation . the time required for the computation of F1 is very large so please suggest me any other alternative for above computation. The gcd function is also required large amount of time for computation . so please suggest me other altrnative or algorithm for computation of one variable polynomial. enter code here 
20180430 03:36:55 0600  received badge  ● Popular Question (source) 
20180423 01:58:43 0600  asked a question  error in elliptic curve scalar multiplication code The following code i have written for scalar multiplication over elliptic curve for prime field 37 but it gives me error for some of the scalar. the method is LSB first. 
20180409 00:14:24 0600  asked a question  Scalar Multiplication: LSB first. code in sagemath Require k=(km1,km2,…,k0)2, km=1 Compute Q=kP Q=0, R=P For i=0 to m1 If ki=1 then Q=Q+R End if R=2R End for kindly provide me sagemath code for above algorithm for prime field 37 and elliptic curve y^2=x^3+7x+25 
20180406 12:16:46 0600  asked a question  binary value how to obtain binary of following an integer.as the object is very large 189866136719308462018271159242437168532L 
20180406 12:09:48 0600  received badge  ● Famous Question (source) 
20180406 12:09:48 0600  received badge  ● Notable Question (source) 
20180406 12:09:48 0600  received badge  ● Popular Question (source) 
20180404 01:31:08 0600  received badge  ● Famous Question (source) 
20180403 10:16:24 0600  asked a question  Elliptic curve scalar multiplication I have implemented the new algorithm for an elliptic curve which will compute 2p,4p,8p,16p,32p........ . i want the flow of code which will use the new algorithm to compute p,2p,4p,8p,16p........... . and store it into array so that i will use it for scalar multiplication. 
20180331 12:29:50 0600  commented answer  elliptic curve scalar multiplication the above code gives me following error when run it on sagemath cloud Error in lines 1316 Traceback (most recent call last): File "/cocalc/lib/python2.7/sitepackages/smc_sagews/sage_server.py", line 1013, in execute exec compile(block+'\n', '', 'single') in namespace, locals File "<string>", line 4 salvus.execute_with_code_decorators(*_salvus_parsing.dec_args[Integer(3)]) ^ SyntaxError: invalid syntax 
20180331 12:24:42 0600  commented answer  elliptic curve scalar multiplication what are the standard add and doubling on E 
20180331 12:14:55 0600  commented answer  elliptic curve scalar multiplication in the above code how the addition and doubling is obtained. 
20180330 10:46:24 0600  asked a question  how to store data in array offline computation , how to store precomputed data in array during scalar multiplication of elliptic curve i want the precomputed data 2p,4p,8p,16p,32p..... for further computation so how to generate that array. 
20180330 10:07:33 0600  commented question  elliptic curve scalar multiplication left to right double and add scalar multiplication algorithm for above parameter KP=k_0p+k_12p+K_24P+.........+K_l2^l1*P I/P point P which is on elliptic curve , K=(k_l1K_l2.....K_0)_2 (that is binary representation of scalar) output KP uses P and Q Q= infinity for i=l1 to 0 do
Q=2Q
if k_i=1 then
Q=Q+P 
20180329 10:06:09 0600  commented question  elliptic curve scalar multiplication tx for your reply but i want the compution using above algorithm. also by defining function point_mul(k,p) where k is scalar and p is the point. 