You are not logged in.
The ultimate goal is hiding the value of Xs and coefficient and giving away the value of Ys. Scenario:Assume we have a polynomial with uniformly random random coefficients chosen from Fp. We pick distinct random Xs values from same field and obtain n different Ys. Now we keep all coefficients and Xs and only give away Ys.
note:all operation are modulo arithmetic
1)My question is can anybody with this Y`s obtain constant term of the initial polynomial?
2)Furthermore, if we construct some more polynomials with different random coefficients. Then use the same X values as above to obtain Y values for each polynomials. Assuming that all polynomials have the same constant term, can anybody without the knowledge of Xs and coefficients obtain the constant term, by having only Ys ?
If not why?
Many thanks
Offline
Is this cryptography?
I think the polynomial can be found..
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
How, why?
Offline
Are you giving out just the y's and nothing else? Then maybe not.
but wait for bobbym
'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'
'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'
I'm not crazy, my mother had me tested.
Offline
if not why? (sorry for keep asking "why" as I need a concrete proof.
Many thanks
Offline
Hi;
How about a small example please.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
In (n,n) Shamir secret sharing if the shareholders have all Y values but not X values, can they still construct the secret?
Hope it helps...
Offline
I remember working on a similar question and the answer was yes. I do not know enough about shamir to answer in this case. Please show me some math question then I can help.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
(n,n) Shamir secret sharing: We construct a polynomial of degree n-1, whose coefficients are uniformly random. Then we get some distinct x values. We give away x values . The secret is the constant term in this polynomial. n-1 share holders cannot obtain the secret but n shareholders can (as we gave away a pair (x,y) to each shareholders). They can do it with Lagrange interpolation.
***** What if we do not send out the X values and only send Y values. would the n shareholders be able to reconstruct a polynomial to obtain the secret?
Offline
Uniformly random? What ranges?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
all operation are modulo arithmetic e.g. mod p, where p is a prime, preferable large enough.
Offline
That is not what I asked. These coefficients of the polynomial, what are there ranges?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
The coefficients are uniformly random chosen from Fp (field)
The x values are distinct values randomly chosen from same field.
Offline
That is not helping. What field?
What uniform distribution? [0,1]? [0,1,2,3,4...p]?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
We pick a prime P which is large enough, then we use modular arithmetic instead of real arithmetic. So these coefficient and x values are chosen from this field [0,p). P is greater than the constant term and constant term and the degree of polynomial.
Regards
Offline
Yes the second one excluding 0
Offline
The coefficients could be zero but X values cannot be zero.
Offline
You are showing something else. You say no 0 but you posted [0,p).
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
As I explained later , the [0,p) applies to coefficients and (0,p) applies to X values. Moreover the X values should be distinct random number.
Offline
So these coefficient and x values are chosen from this field [0,p).
You said there they include 0.
As I explained later , the [0,p) applies to coefficients and (0,p) applies to X values. Moreover the X values should be distinct random number.
Here you said something else. Which is it?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Please consider the latest comment(the second comment that separates coefficients range from x values range)
Thank you again for your help.
Offline
p I assume is a prime, therefore this is a Galois field?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Yes , P is a prime number.
Offline
Here is where you come to help. Make up a polynomial that fits your criterion. Give me the y's and the degree of the poly. Also, provide the mod. I will try to crack your code.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Cool,
p=123457
y1=316
y2=637
degree of the polynomial is one
Offline