<oembed><type>rich</type><version>1.0</version><author_name>npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet</author_name><author_url>https://nostr.ae/npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2014-04-04&#xA;📝 Original message:On Fri, Apr 4, 2014 at 10:16 AM, Matt Whitlock &lt;bip at mattwhitlock.name&gt; wrote:&#xA;&gt; Honestly, that sounds a lot more complicated than what I have now. I made my current implementation because I just wanted something simple that would let me divide a private key into shares for purposes of dissemination to my next of kin et al.&#xA;&#xA;I suggest you go look at some of the other secret sharing&#xA;implementations that use GF(2^8), they end up just being a couple of&#xA;dozen lines of code. Pretty simple stuff, and they work efficiently&#xA;for all sizes of data, there are implementations in a multitude of&#xA;languages. There are a whole bunch of these.&#xA;&#xA;&gt; I already have a fairly polished implementation of my BIP, and it&#39;s not written in a &#34;very high-level language&#34;; it&#39;s C++, and the parts that do the big-integer arithmetic are basically C. I&#39;m using the GMP library: very straightforward, very reliable, very fast.&#xA;&#xA;With respect for the awesome work that GMP is—  It&#39;s 250,000 lines of&#xA;LGPLed code.  It&#39;s not just &#34;pic microcontrollers&#34; that would find&#xA;that scale of a dependency unwelcome.&#xA;&#xA;&gt; Do you have a use case in mind that would benefit from byte-wise operations rather than big-integer operations? I mean, I guess if you were trying to implement this BIP on a PIC microcontroller, it might be nice to process the secret in smaller bites. (No pun intended.) But I get this feeling that you&#39;re only pushing me away from the present incarnation of my proposal because you think it&#39;s too similar (but not quite similar enough) to a threshold ECDSA key scheme.&#xA;&#xA;It lets you efficiently scale to any size data being encoded without&#xA;extra overhead or having additional primes. It can be compactly&#xA;implemented in Javascript (there are several implementations you can&#xA;find if you google), it shouldn&#39;t be burdensome to implement on a&#xA;device like a trezor (much less a real microcontroller).&#xA;&#xA;And yea, sure, it&#39;s distinct from the implementation you&#39;d use for&#xA;threshold signing. A threshold singing one would lack the size agility&#xA;or the easy of implementation on limited devices.  So I do think that&#xA;if there is to be two it would be good to gain the advantages that&#xA;can&#39;t be achieved in an threshold ECDSA compatible approach.</html></oembed>