717 reputation
419
bio website lamontconsulting.com
location New York, NY
age 38
visits member for 3 years, 5 months
seen Jan 21 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


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?
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
revised Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?
added 39 characters in body; edited title
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
Oct
21
awarded  Excavator
Oct
21
revised Why is elliptic curve cryptography not widely used, compared to RSA?
FIPS 186-3 has been superseded with FIPS 186-4 - updated link
Oct
21
suggested approved edit on Why is elliptic curve cryptography not widely used, compared to RSA?
Oct
21
asked Can Secp 256 K1 curves “map” to a value on FIPS 186-3 or P-256?