4,067 reputation
1830
bio website
location Wellington, New Zealand
age
visits member for 3 years, 2 months
seen 2 hours ago

I am an undergraduate computer science and mathematics student in New Zealand. My fields of interest are computer graphics, in particular the physics of light transport, and to some extent cryptography, as well as programming and software development in general.


Feb
2
reviewed Satisfactory Blind quantum computing and fully homomorphic encryption
Feb
2
reviewed Excellent What exactly is a negligible (and non-negligible) function?
Feb
2
reviewed Satisfactory Does RSA-OEAP have integrity and authenticity properties?
Feb
2
reviewed Excellent Deriving Keys for Symmetric Encryption and Authentication
Feb
2
reviewed Satisfactory A situation where security by obscurity might be the best solution - or am I wrong?
Feb
2
reviewed Satisfactory Number of states in a LFSR
Feb
2
comment ECDH VS. DH benchmarking in JAVA
@CodesInChaos Thanks for the correction, not very literate in ECC. Still, I think the question should be rewritten to ask for theoretical differences in performance (based on the algorithms themselves and not a black-box implementation) to be on topic.
Feb
2
comment ECDH VS. DH benchmarking in JAVA
Sorry but none of us know how to program, at least that is the assumption you should be going with when posting on Crypto SE. It is likely questions with large amounts of code are better suited on StackOverflow or Security SE, and it is the case here. That said, I suppose the time difference is due to the fact that generating an ECDH key isn't as easy as selecting a random prime, you need to perform some setup operations, likely more than in DH (or maybe your KeyPairGenerator is slow, but that's out of our control).
Feb
2
comment Why would this method of discrete logarithm finding not work?
Python would probably be simpler than GP/Pari for prototyping, at least in my opinion, and when applied to most input sizes, algorithmic performance will dominate anyway.
Jan
31
comment Is (2^333)-1 a prime number?
Ask Wolfram|Alpha!
Jan
31
comment How to best obtain bit sequences from throwing normal dice?
@owlstead Feel free to edit my answer to insert your results in, they would be a useful and welcome addition :)
Jan
31
revised How to best obtain bit sequences from throwing normal dice?
grammer!!
Jan
30
answered How to best obtain bit sequences from throwing normal dice?
Jan
30
comment How to best obtain bit sequences from throwing normal dice?
This previous question may be relevant.
Jan
30
comment Decryption a chunk of file with AES
You can do that, but you'll have to create individual MAC fingerprints for each chunk (or authenticate everything before) because unauthenticated data is worthless. Depending on the number of chunks, this may or may not be viable.
Jan
29
comment How do I derive the time complexity of encryption and decryption based on modular arithmetic?
@almodawan My comment assumed $n$ (or $N$) is the modulus itself, and $\log{n}$ (or $\log{N}$) is the number of digits. I find using the same symbol with different capitalization for two different concepts is very misleading and error-prone, but you are of course free to convert to your own notation.
Jan
29
comment How do I derive the time complexity of encryption and decryption based on modular arithmetic?
Note $\log{d} \approx \log{n}$ but $\log{e}$ is independent of $n$ - since $e$ is generally taken as a small value, so in this sense $O(\log{e}) = 1$ (slight abuse of notation). I assume this is the RSA algorithm.
Jan
28
comment Do practical key-less cryptosystems exist?
I think we can assume that IV's and counters will never feasibly repeat for a decent block size (128 or 256 bits), the only problem left being key compromise: how to recover if the key is leaked? do you lose backward and possibly forward secrecy? etc..
Jan
28
comment Do practical key-less cryptosystems exist?
Look up "security by obscurity" and "Kerckhoffs's Principle".
Jan
27
reviewed Reviewed Theoretical pi-based stream cipher