Reputation
764
Top tag
Next privilege 1,000 Rep.
Edit questions and answers
Badges
5 19
Impact
~20k people reached

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?
Sep
19
comment What is the lowest level of mathematics required in order to understand how encryption algorithms work?
Related How do I learn Cryptographic/Mathematical notation
Jul
22
comment How can I tell which curve a given ECDSA implementation uses? (P-521 or something else)
I just purchased that $99 book the other day. Glad to know I have the right study material. Thanks for confirming that, and let me know if you come across anything else I should know
Jul
22
comment How can I tell which curve a given ECDSA implementation uses? (P-521 or something else)
I'd like to study the equation 'y^2 = x^3 + ax + b` in more depth. Where should I begin? (how are those variables generated, what are known weaknesses, etc?)
Jul
4
comment Given a message and signature, find a public key that makes the signature valid
Note: If you didn't intend to make this "community wiki" you can flag this for a moderator to undo that... and you can continue to gain reputation for the posting.
Jul
3
comment Why is “mod(n)” so central to most aspects of cryptography?
In an OTP, XOR was explained to me as having a 50% chance of being 1 or 0, resulting in an output with perfect secrecy (up the the limits of the PRG). Is it true that any modulo done in base 10 has a 10% chance of being a given number? If the answer is yes, then I am totally on board.
Jul
1
comment Why is “mod(n)” so central to most aspects of cryptography?
Here is the official take on duplicate questions on this site Where this particular question falls I'm open to whatever is decided.
May
22
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
Part 2 - Could this "risk" be explained to management as the quantity of brute force attempts that we will tolerate? (substitute brute force for X chosen message attacks etc) and 2^64 is the minimum required due diligence?
May
22
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
Part 1 - Could this number (1/2^32) be compared to a Birthday Attack, where the distribution is non-uniform? Namely, where there there is tipping point of where 0.. to some negligible number increases rapidly to a non-negligible number?
May
21
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
@curious Yes, they are from his coursera course. It's really good and packed full of information. I discovered this 2 weeks ago and am trying to finish all the classes in 1 month so I can start the next one on time.
May
18
comment Generating IV in TLS 1.2
I'd be curious to see your C# implementation. Do share a link if you can.
May
18
comment When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
I learned something new today en.wikipedia.org/wiki/Asymptotic_security
May
17
comment When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
Is it correct for me to think/say "negligible in terms of brute forcing". Does negligible apply to any other attack other than brute forcing?
Apr
22
comment LT codes with Homomorphic hashing
Dumb question: What does the symbol ⊕ mean?
Apr
11
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
I see it here.. will read it. en.wikipedia.org/wiki/Blind_signature
Apr
11
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
I'm very interested in learning how this would operate, though the Wiki page for ecash is of no use, and all the pages are dead. Do you have any more info or references so I can understand what you mean by a "blind signature on a serial number"... and it's removal?
Mar
27
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
So that means the issuer needs N attributes, and selectively disclosing them one by one? I suppose I need to mention that the quantity of locations the UProve user will be dealing with numbers in the the millions. A UProve token with just 255 proofs takes quite a long time to generate. I hope there is another solution.