492 reputation
1621
bio website
location
age
visits member for 3 years, 1 month
seen Apr 24 at 10:39

Jan
1
comment How can I solve congruence modulo N?
Values of $J_A$ and $e$ are known. I am using example from GQ signature scheme from the book Page 451 cacr.uwaterloo.ca/hac/about/chap11.pdf
Jan
1
asked How can I solve congruence modulo N?
Dec
28
awarded  Commentator
Dec
28
comment How to select parameters based on some condition
Random is the accepted method? Whether RSA uses random method?
Dec
28
asked How to select parameters based on some condition
Dec
27
awarded  Benefactor
Dec
27
accepted Shadowed identity in cryptography
Dec
27
comment Shadowed identity in cryptography
Using the same example from the text, when I took $modularpow(J,phi−s,n)$, I am getting the value as -126739. I have J=34579, phi= 419184, s=233875 and n=420491
Dec
27
comment Shadowed identity in cryptography
One last question. There is an equation in the text "$s_A=(J_A)^{−s}mod\ n$". How could I calculate that? Taking $(J_A)^{−s}$ and taking mod n?
Dec
27
revised Shadowed identity in cryptography
one more question added
Dec
26
comment Shadowed identity in cryptography
What is the recommended method for calculating shadow?
Dec
25
awarded  Critic
Dec
25
awarded  Promoter
Dec
22
asked Shadowed identity in cryptography
Dec
17
comment Authentication mechanism for low memory, low computing power device
@skillzeo I cant use this since it require computation at both parties and have to send messages between them many times
Dec
17
revised Authentication mechanism for low memory, low computing power device
improved question
Dec
17
asked Authentication mechanism for low memory, low computing power device
Dec
9
awarded  Popular Question
Nov
16
awarded  Popular Question
Sep
5
awarded  Yearling