20,510 reputation
32573
bio website
location
age
visits member for 3 years, 2 months
seen yesterday

Feb
9
reviewed Approve suggested edit on RSA assumption and cryptography
Feb
8
answered One-time digital signatures
Feb
8
comment Generating Diffie-Hellman parameters efficiently
Right on, @RickyDemer -- thank you! Fixed.
Feb
8
revised Generating Diffie-Hellman parameters efficiently
added 4 characters in body; added 84 characters in body
Feb
7
answered Generating Diffie-Hellman parameters efficiently
Feb
7
revised Generating Diffie-Hellman parameters efficiently
Improve title, tags, and grammar.
Feb
7
reviewed Approve suggested edit on Generating Diffie-Hellman parameters efficiently
Feb
7
comment Help in understanding exactly how lattices used as one way functions for hashing
you wrote "I just wish I could find some text which explained this in English rather than symbols". I'm afraid you're not likely to be able to understand this without mathematics (i.e., symbols). I don't mean to be rude, but you might want to consider the possibility that you do not have the necessary mathematical background to understand the answers to the questions you posed. Perhaps you are better off either focusing on strengthening your math skills, or moving to a different topic where you do have the preparation.
Feb
6
awarded  Popular Question
Feb
6
awarded  Enlightened
Feb
6
awarded  Nice Answer
Feb
6
awarded  block-cipher
Feb
6
comment Homomorphic encryption for vector addition
$p$ could be something like $2^{32}$... but depending upon the scheme, it might also be something like a large prime number. Different schemes will be able to support different values for $p,q,r$. So, if you want us to propose a scheme, you'll need to tell us whether you have any specific requirements on what kinds of values of $p,q,r$ will work for you. If there are any combinations of $p,q,r$ that won't work for you, tell us that. If you absolutely must have wraparound occur at $p=q=r=2^{32}$ for all three components, tell us that. etc.
Feb
6
comment Homomorphic encryption for vector addition
@uosɐſ, as you correctly anticipated, the integer arithmetic is going to wrap around eventually: keep incrementing, and eventually you'll get back to zero. This is pretty much inevitable, especially since we're working with modular arithmetic. $p$ is the number where wrap-around happens for the first component. Take $\langle 1,0,0 \rangle$ and keep adding it to itself. You'll get $\langle 2,0,0 \rangle$, $\langle 3,0,0 \rangle$, etc. until $\langle p-1,0,0 \rangle$: then when you add one, it wraps around to $\langle 0,0,0 \rangle$. Similarly, $q,r$ are the modulus for the 2nd/3rd component.
Feb
5
comment Practical (and secure) PRGs
Good point, @user4982! Thank you -- I have edited my answer accordingly.
Feb
5
revised Practical (and secure) PRGs
added 93 characters in body
Feb
5
answered Practical (and secure) PRGs
Feb
4
answered Hill cipher, unknown letter value
Feb
4
comment Hill cipher is not perfectly secure
@Valtteri, well done!
Feb
4
answered Hill cipher is not perfectly secure