657 reputation
418
bio website lamontconsulting.com
location New York, NY
age 37
visits member for 3 years
seen Aug 16 at 12:40

SSL isn't good enough. Your website can be hacked.
Help solve the problem by advocating these RFCs:

TLSA (formerly DANE for DNS) Fixes the hackable CA problem

TLS-OBC: Fixes TLS, and the Related Domain Cookie Attack


About me
I have no relation to the above sites; I am just an advocate

Why "makerofthings7"? It's a challenge to "make seven things in my life of significant quality and value". Who knows if those things will take the form of software, art, or people. (I'm not married, no kids yet)

See ...my LinkedIn profile


Dec
9
comment Can a zero knowledge proof (or MAC) be generated from human-typable input?
@nightcracker , I suppose what I'm looking for is a "non-interactive" zero knowledge proof.
Dec
9
comment Can a zero knowledge proof (or MAC) be generated from human-typable input?
@DrLecter I'll take a look at those papers, but I was thinking of something like TOTP, where the private key signs the current time in 10 minute intervals, and that output be 2^92 secure. Replacements for TOTP is what I was looking for
Dec
9
asked Can a zero knowledge proof (or MAC) be generated from human-typable input?
Oct
26
accepted How do I know if a given curve requires a FpCurve F2mCurve or ECCCurve?
Oct
25
asked How do I know if a given curve requires a FpCurve F2mCurve or ECCCurve?
Oct
25
asked Can keys from Bitcoin's Hierarchical Deterministic Wallets be correlated (reducing privacy)?
Oct
23
comment What is the most secure hand cipher?
@DavidCary isn't OTP subject to statistical analysis if something like ASCII is used?
Oct
23
comment In RSA, what is faster attacking “d” when plaintext is known, or factoring when M is unknown?
And this is exactly why I keep coming here for perspective. Thank you!
Oct
23
comment In RSA, what is faster attacking “d” when plaintext is known, or factoring when M is unknown?
Regarding x/2... since I'm testing values for φ, φ has the same length as the key, and all of φ must be even, can I simply eliminate the odd values for φ and cut my brute-force space in half? or does 2^x-1 refer to something else?
Oct
23
accepted In RSA, what is faster attacking “d” when plaintext is known, or factoring when M is unknown?
Oct
23
comment In RSA, what is faster attacking “d” when plaintext is known, or factoring when M is unknown?
@CodesInChaos my understanding of how attack 1 was done was as an observer, or peer on the same subnet seeing packets. My goal is to understand how relatively hard each approach is... So if an advance in math is discovered I can estimate the impact to security
Oct
23
revised How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
edited title
Oct
23
asked In RSA, what is faster attacking “d” when plaintext is known, or factoring when M is unknown?
Oct
23
accepted How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
Oct
23
comment How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
Wow 2^1024 is huge. No wonder I haven't seen this approach discussed anywhere.
Oct
23
comment How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
First Q: What is the word for " \varphi " I'm inferring the meaning but want to google it. Part 2: does the generation test only apply to a known implementation (Windows, Bouncy Castle, etc) and not a private one with possibly different values? Or should it be consistent among implementations?
Oct
23
revised How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
added 31 characters in body
Oct
23
revised How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
added 50 characters in body
Oct
22
revised How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?
added 24 characters in body
Oct
22
asked How difficult is it to brute force d in RSA: d = (1/e) mod φ in a CPT attack?