657 reputation
418
bio website lamontconsulting.com
location New York, NY
age 38
visits member for 3 years, 1 month
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


Jul
20
comment How do the following new (2013) ECC curves compare in security or efficiency?
If you refrain from closing I'll make the requested modifications later tonight.
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
6
comment What is a Non-Interactive Zero Knowledge Proof?
Would this MAC for anonymous credentials be considered a non-interactive ZK proof?
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
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
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
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
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
21
comment Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?
Fundamentally, I want to use UProve crypto material in Bitcoin transactions.
Oct
21
comment Compressing EC private keys
FYI the link to PRNG has been updated, and it seems it will be revised again soon after public comment. Here are the interim links: SP800-90A and the public drafts
Oct
21
comment Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?
I will look more into group structures and group orders as you mention... but if instead of P-256, could any interesting maps be made with field based subgroups FIPS 186-3 and Secp 256 K1?
Oct
21
comment Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?
@CodesInChaos I don't know how to even begin to define equivalence in curves. Could FIPS 186-3 be equivalent?
Oct
21
comment Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?
@RichieFrame UProve also uses a subgroup variant which is FIPS 186-3 finite field based DSA. Would that mean a mapping is possible
Sep
27
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
What information would be in that attribute? Is it encrypted data?