35 reputation
5
bio website
location
age
visits member for 1 year, 10 months
seen Dec 2 '13 at 7:00

2d
awarded  Popular Question
Feb
19
awarded  Supporter
Feb
19
accepted Implementations of Ntru TLS
Feb
19
comment Implementations of Ntru TLS
Hey Tim, Security Innovations got back to me and provided a student / not for profit license to use it. It's in C so there will be some hackery required, but it will work hopefully.
Feb
16
asked Implementations of Ntru TLS
Nov
13
comment Montgomery Exponentiation - selecting input value R for a given BigInteger
@CodesInChaos no it was an assignment! Would you care to make a comment or two on codereview.stackexchange.com/questions/18199/…? The assignment due date has passed so you can say as much as you like.
Nov
11
comment Montgomery Exponentiation - selecting input value R for a given BigInteger
Thank you, this was how I was calculating R. I guess the slowdown is the way I programmed the actual Montgomery methods monPro and modExp (See the code review I example I linked if you are a coder)
Nov
11
revised Montgomery Exponentiation - selecting input value R for a given BigInteger
Added a link to full code of the problem
Nov
11
asked Montgomery Exponentiation - selecting input value R for a given BigInteger
Nov
9
awarded  Student
Nov
9
comment How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Can anyone think of a way to solve this negativity problem in Java using BigIntegers? I tried a couple of things, firstly by pre computing Cp - Cq. I checked the answer is negative (BigInteger computed.compareTo(BigInteger.ZERO) <)) and then tried the following - 1. call BigInteger(abs) on it. This didn't seem to work.
Nov
8
comment How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Poncho if you also have a stack overflow account and would like to maybe answer by linking to this page I'll mark that the answer too.
Nov
8
awarded  Scholar
Nov
8
accepted How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Nov
8
comment How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Wow, thank you so much, that makes so much sense. I don't understand, however, how (1 * (2 - 3) mod 5) is 4. 2-3 is -1, multiply by 1 is still -1, mod 5 of -1 is -1?
Nov
8
revised How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
added 94 characters in body
Nov
8
comment How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Hey mikeazo, I've edited it, hopefully it's much clearer now. The link you posted for the CRT is certainly helpful, but again, I have trouble following the math near the end of the answer.
Nov
8
awarded  Editor
Nov
8
revised How can I use eulers totient and the chinese remainder theorem for modular exponentiation?
Edited to clarify due to comment feedback on the original question, made the question title clearer.
Nov
8
asked How can I use eulers totient and the chinese remainder theorem for modular exponentiation?