631 reputation
317
bio website lamontconsulting.com
location New York, NY
age 37
visits member for 2 years, 8 months
seen Apr 18 at 18:54

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


Mar
18
revised Which of following new (2013) ECC curves is the most secure or efficient?
added 50 characters in body; edited tags; edited title
Mar
17
asked Which of following new (2013) ECC curves is the most secure or efficient?
Mar
5
awarded  Popular Question
Mar
3
awarded  Notable Question
Feb
11
comment If its possible to derive the public key from a private key, why can't we go in reverse?
I see. There is more than one notation style. That has been confusing me for quite some time, as I cross reference my books.
Feb
11
comment If its possible to derive the public key from a private key, why can't we go in reverse?
I'm not sure if this kind of key recovery applies to the 3 scenarios. Again this is all self study so if you have a better path to learning, please do share.
Feb
11
comment If its possible to derive the public key from a private key, why can't we go in reverse?
@CodesInChaos Thanks. From my algebra background I see A = aG as simple variables. Is the difficulty inherent in the fact we're looking at a multiplicative cyclic group? My intent with this question is to study the simplest approaches to key recovery with crypto the following categories: 1: integer factorization, 2: discrete logarithm, 3: ECC discrete logarithms.
Feb
11
asked If its possible to derive the public key from a private key, why can't we go in reverse?
Feb
6
comment What is a Non-Interactive Zero Knowledge Proof?
Would this MAC for anonymous credentials be considered a non-interactive ZK proof?
Jan
15
awarded  Popular Question
Dec
26
awarded  Nice Question
Dec
11
revised Has the distributed project “Number Fields @ Home” project benefited cryptography in any meaningful way?
added 7 characters in body; edited title
Dec
11
revised Has the distributed project “Number Fields @ Home” project benefited cryptography in any meaningful way?
edited title
Dec
11
asked Has the distributed project “Number Fields @ Home” project benefited cryptography in any meaningful way?
Dec
9
revised Can a zero knowledge proof (or MAC) be generated from human-typable input?
added 19 characters in body
Dec
9
comment Can a zero knowledge proof (or MAC) be generated from human-typable input?
@DrLecter I just added details on my use-case
Dec
9
revised Can a zero knowledge proof (or MAC) be generated from human-typable input?
added 576 characters in body
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?