ampersand

160 reputation

bio	website
	location
	age
visits	member for	1 year, 1 month
	seen	Apr 17 at 23:31
stats	profile views	3

I develop in javascript as a hobby.

My current projects can be found on Github.

You can Tip Me if you have been helped and are so inclined.

	160 reputation	bio	website		visits	member for	1 year, 1 month
6 badges		location			seen	Apr 17 at 23:31

summary answers questions tags badges favorites bounties reputation activity

23 Actions

suggestions reviews revisions comments badges posts accepts all

Dec 21	accepted	Does zero-padding the secret in Shamir's sharing scheme increase security?
Dec 20	asked	Does zero-padding the secret in Shamir's sharing scheme increase security?
Dec 16	accepted	How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$?
Dec 15	comment	How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? @PaŭloEbermann you are correct, I entered the interval incorrectly. Fixed now, thank you.
Dec 15	revised	How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$? deleted 6 characters in body; edited title
Dec 15	revised	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme added 13 characters in body
Dec 15	asked	How to generate a random integer in interval $[1, 2^n-1]$ from random integer in interval $[0, 2^n-1]$?
Dec 11	comment	Contruct a protocol to determine if three secret keys are different, without revealing any of them? Are they to communicate sequentially? Therefore the last party will be the one to report whether the secrets are equal? Or must everyone communicate with everyone else and each determine individually the (non)equivalence of their secrets?
Dec 9	comment	Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? In the typical programming scenario, it wouldn't be created then evaluated. It would just be evaluated at xi by summing the values of the basis polynomials evaluated at xi. The same programming construct the parties use to evaluate L(0) can be used to evaluate L(xi). Not sure if you need me to recreate the steps or the polynomial here, or if you are getting at something else?
Dec 8	revised	Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? added 303 characters in body
Dec 8	revised	Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret? added 303 characters in body
Dec 4	awarded	Teacher
Dec 3	answered	Is there a secret sharing scheme which allows delegation/re-sharing without reconstructing the original secret?
Nov 28	comment	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme @fgrieu thanks for that quote. I overlooked it. Had I read that statement I would not have asked this unnecessary Q.
Nov 28	awarded	Scholar
Nov 28	accepted	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme
Nov 28	revised	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme added 40 characters in body
Nov 28	awarded	Student
Nov 28	revised	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme added 13 characters in body
Nov 28	asked	Necessity for finite field arithmetic and the prime number p in Shamir's Secret Sharing Scheme