41 reputation
14
bio website
location
age
visits member for 1 year, 10 months
seen Feb 4 '13 at 16:51

Jan
21
asked How compared encryption algorithm in terms of efficiency
Jan
21
comment How can I calculate the time complexity of modular arithmetic?
thank you ms fgrieu. I ask now . Is there a way to compare algorithms better account of the complexities of time.I hope the proposal by any other method. Thank you again.
Jan
20
awarded  Student
Jan
20
comment How can I calculate the time complexity of modular arithmetic?
I'm hope for your response me. your suggest it's ok.First procedure i = a^-1 mod n next line m = i * b mod n. and second procedure c = a * b mod n . that I don't know how compute O(n) for first procedure I think first procedure time complexity is O(n^3) and second procedure time complexity is O(n^2). Is this true.
Jan
20
comment How can I calculate the time complexity of modular arithmetic?
I'm hope for your response me
Jan
20
comment How can I calculate the time complexity of modular arithmetic?
I mean at Time Complexity related at analysis algorithm operation
Jan
20
comment How can I calculate the time complexity of modular arithmetic?
Thank you for response. I know variable a and b should be between 1 to n-1 ok. I want compare two lines . Is it this operand c= a * b mod n speedup from operand m = c ^-1 * b mod n or Vice versa.
Jan
20
comment How can I calculate the time complexity of modular arithmetic?
Thank you for response. I know variable a and b should be between 1 to n-1 ok. I want compare two lines . Is it this operand c= a * b mod n speedup from operand m = a ^-1 * b mod n or Vice versa.
Jan
20
asked How can I calculate the time complexity of modular arithmetic?