[144271] in cryptography@c2.net mail archive
Re: Shamir secret sharing and information theoretic security
daemon@ATHENA.MIT.EDU (sbg@acw.com)
Mon Feb 23 13:10:12 2009
In-Reply-To: <E6BCB5EC-8EA3-4EA7-8D24-5CD4C9FA8E98@lrw.com>
Date: Mon, 23 Feb 2009 11:05:47 -0700 (MST)
From: sbg@acw.com
To: "Jerry Leichter" <leichter@lrw.com>
Cc: "R.A. Hettinga" <rah@shipwright.com>,
"Cryptography" <cryptography@metzdowd.com>
Is it possible that the amount of information that the knowledge of a
sub-threshold number of Shamir fragments leaks in finite precision setting
depends on the finite precision implementation?
For example, if you know 2 of a 3 of 5 splitting and you also know that
the finite precision setting in which the fragments will be used is IEEE
32-bit floating point or GNU bignum can you narrow down the search for the
key relative to knowing no fragments and nothing about the finite
precision implementation?
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
