Reid

716 reputation

bio	website
	location	Tennessee
	age	19
visits	member for	11 months
	seen	4 hours ago
stats	profile views	1

I am an undergraduate university student double majoring in Computer Science and Mathematics hoping to pursue a research career in cryptography. Other interests include software engineering and Linux-based system administration.

	716 reputation	bio	website		visits	member for	11 months
19 badges		location	Tennessee		seen	4 hours ago

summary answers questions tags badges favorites bounties reputation activity

81 Actions

suggestions reviews revisions comments badges posts accepts all

2d	awarded	Informed
Jun 15	awarded	Organizer
Jun 15	revised	How do I decrypt ciphertext with this cipher? Clean up grammar and formatting, MathJaX-ify the math stuffs.
Jun 15	answered	How do I decrypt ciphertext with this cipher?
Jun 15	suggested	suggested edit on How do I decrypt ciphertext with this cipher?
Jun 14	revised	OpenSSL AES 256-bit Key Management Added a note about the lack of a work factor in the home-made KDF
Jun 14	comment	OpenSSL AES 256-bit Key Management @Gilles: I said "somewhat" questionable, not "somewhat questionable". :)
Jun 14	answered	OpenSSL AES 256-bit Key Management
Jun 13	comment	Encrypting and MACing different data with same key @B-Con: The way I interpret this question, he isn't asking whether or not you should encrypt and MAC the same data with the same key. Rather, he's asking is it okay if you MAC some data and then encrypt some other data with the same key.
Jun 13	comment	Is it possible to cryptographically prove when was the last time a ciphertext was decrypted/encrypted? Can you control access to the ciphertext? (That is, can you log when people downloaded it, for example?) If so, then you could use write-once memory to log who downloaded it and when, and if your authentication includes knowledge of the key, then you can assume it was decrypted when downloaded. That seems a fairly safe assumption. After all, once the ciphertext leaves your system, your options become much more limited.
Jun 13	comment	Why is it impractical to generate a semiprime dictionary? @PaŭloEbermann: I was envisioning storing each 2048-bit semiprime plus the two factors, each around 1024 bits.
Jun 12	comment	Why is it impractical to generate a semiprime dictionary? @CodesInChaos: Oh, come on, that's only $2.743 \times 10^{279}$ yottabytes! (Just to store the semiprimes, that is. You'd need approximately double the space to store the factors too.)
Jun 11	revised	Security strength of RSA in relation with the modulus size Flesh out details in the answer
Jun 11	revised	Security strength of RSA in relation with the modulus size added 96 characters in body
Jun 11	answered	Security strength of RSA in relation with the modulus size
Jun 11	comment	Can any one explain Circuit Privacy using fully homomorphic encryption from Gentry's thesis? To be brutally honest, it is a Ph.D. dissertation. That document earned someone a doctoral degree at a top university. I would not expect it to be easy to read. That being said, what is it exactly that you are having trouble with? Are you having problems with the definition of circuit privacy, or is it how Gentry transforms his scheme into a circuit-private one? Or both?
Jun 11	revised	What are some good references for the implementation weaknesses in RSA Added a note about looking at other implementations
Jun 11	answered	What are some good references for the implementation weaknesses in RSA
Jun 10	awarded	Critic
Jun 9	answered	Is this OTP scheme safe?