19,761 reputation
32271
bio website
location
age
visits member for 2 years, 11 months
seen 16 hours ago

Feb
18
comment Proving that a function is not a OWF (One-way-function)
@Pinocchio, yes, for a random $x$. Yes, my answer does not depend upon how $f$ is constructed; it applies regardless.
Feb
18
comment Proof of work for standard computers
Two candidates come to mind. (1) Find an input to scrypt that makes the first 20 bits of its output all zeros. Verification is now pretty cheap. (2) Use timelock puzzles. They admit a very large ratio between the time to solve the puzzle vs the time to construct the puzzle (or to verify the solution).
Feb
16
comment Known vulnerabilities in (EC-)KCDSA
jimmy, Have you done a literature search? That's the obvious first step.
Feb
16
comment ML/NN Cryptanalysis
My advice would be to stick to one question per question. Here you have 3 separate question, all concatenated into the same question box. That isn't a good fit for this site; a good question should have a single answer. (Actually, the 3rd one -- "any other tricks..." -- is also not a good fit, as it is too unfocused.) Also, we expect you to do some research on your own and tell us what you've tried; I don't see that in the question at present. Finally, I suggest starting from the goal (drive in a nail) and ask for a solution, rather than starting with a hammer and looking for nails.
Feb
16
comment Where can I find source code of a compiler that secures a circuit (or attemps to)?
Others have expressed the view that requests for implementations are off-topic on this site. See meta.crypto.stackexchange.com/q/191/351.
Feb
12
comment Proof of work for standard computers
Can you please disclose your relationship to Cuckoo Cycle in the answer, to comply with site standards about this? Thank you.
Feb
8
comment Generating Diffie-Hellman parameters efficiently
Right on, @RickyDemer -- thank you! Fixed.
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
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
4
comment Hill cipher is not perfectly secure
@Valtteri, well done!
Feb
4
comment Game with symmetric key
What do you think? What have you tried? We prefer you to make an effort on your own before asking. This is a nice exercise, but we're not here to solve your exercises for you -- on the other hand, if you have a specific question about a specific aspect of your attempt at a solution, that might be more suitable for this site.
Jan
31
comment Addition-only PHE in F#
@uosɐſ, that's a different question, so it should be posted separately as a separate question. One question per question, please: this is not a discussion forum, so it's important to keep things focused. I think I might be able to propose some candidate solutions, but I don't want to post it here.
Jan
30
comment Efficient Robust Private Set Intersection Questions
user11706, The etiquette on this site is to edit the question to include this information into the question. When asked for clarification, don't just add a comment; edit the question to make it self-contained. People shouldn't need to read the comment thread to understand everything needed to understand the question. Looks like figlesquidge has done that for you, but you should do it yourself in the future.
Jan
30
comment Efficient Robust Private Set Intersection Questions
Section 3.4 of what? Step 7 of what? I have no idea what you are referring to. What have you tried? Do you understand what it means to work in a finite field? I suggest you go back and review the basics, like finite fields and modular arithmetics.
Jan
29
comment Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
@Angela, ahh, good question! Probably the answer will depend on the formulas or how they were generated; in some cases, yes, knowing the explicit formulas will allow you to invert them -- but not always. I don't know if it is possible to give a general answer.
Jan
29
comment Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
Oh, also: you're going to need to give us some way to get some element(s) of $S$ to get started, otherwise we have no way to do anything in $S$ (we don't have anything we can apply the $\Delta$ or $*$ operations to). So what can we do? Can we generate a random element of $S$? If yes, are we told what element of $R$ it corresponds to?
Jan
29
comment Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
Finally, I'll comment that a ring is an algebraic structure that has more than just addition and multiplication as operations. It also has negation (the inverse for addition) and inversion (the inverse for multiplication) maps, i.e., the maps $x \mapsto -x$ and $x \mapsto x^{-1}$. Are we given the ability to apply these maps to elements of $S$ of our choice? The natural answer would be "yes" (but in that case the question becomes trivial). If the answer in your situation is "no", why not? What is the motivation for the question?
Jan
29
comment Efficiently computing the neutral element in a ring isomorphic to Z/NZ?
Also I think you need to be more careful about how elements of $S$ are represented, and what it means to be given an element of $S$. Presumably what you mean is that there is some way of representing an element of $S$, and when we are given an element of $S$, you mean we are given the corresponding bit string. OK, fine. So, what do we know about the representation? What are we given? Do we know the map from elements of $S$ to bit strings, or the reverse map? I suggest you take more care in your question to distinguish an element from the representation of that element.