• Breaking News

    Saturday, February 17, 2018

    Home Unlabelled Cryptography schnorr ring signatures

    Cryptography schnorr ring signatures

    February 17, 2018

    Cryptography schnorr ring signatures

    schnorr ring signatures

    Posted: 16 Feb 2018 08:10 AM PST

    Hey guys,

    I've been reading some papers on various ring signature schemes recently, and I wanted to try and implement one myself in go to see how fun that would be. It was a good learning experience, if some of you have played with ring signatures before and are interested, here is the code: https://github.com/t-bast/ring-signatures

    Obviously it's not ready for real-world use (and may never be), never roll your own crypto, etc, etc, but if you do find flaws in the implementation I'd be very happy to discuss them as a learning experience.

    And if some of you have good learning resources that explain how I could audit the security of my implementation, that would be very valuable.

    Cheers!

    submitted by /u/bast42
    [link] [comments]

    RSA/DSA with huge keys is slow. Is anything else really wrong with it?

    Posted: 16 Feb 2018 09:49 AM PST

    These days, there are good algorithms for factoring primes. Because of that, it's wise to use 4096 bit RSA keys if you're going to use RSA. Because of the 4096-bit keys, RSA can be slow.

    Suppose I don't mind the fact that it's a little slow. Is anything else really wrong with RSA? I know it's fallen out of favor, but is it just the speed?

    submitted by /u/joshyelon
    [link] [comments]

    How many bits of security can I get for a signature of b bits, where b is unusually small such as 64-192 bits?

    Posted: 16 Feb 2018 10:57 AM PST

    ed25519 has 256 bit pubkey and 512 bit sig.

    I'd like to scale a very low security streaming vector mirroring service, where each ipv4:port streams an int16 about 32 times per second and mirrors a few hundred other such numbers in realtime. So I have a use for many small signatures each with a time and value.

    A ed25519 pubkey can be generated deterministicly such as by a hash of 96 bits, so only those 96 bits need be mirrored. But the signature size is a bottleneck. I dont want computers to have to make a network call to verify what another computer claims a number is. The proofs should be small enough they can be mirrored along with the values, and for that I'm willing to sacrifice bits of security for temporary streaming.

    An example use of this network protocol is experiments in how people can interact with eachother through neuralnets.

    submitted by /u/BenRayfield
    [link] [comments]

    About decryption of RSA

    Posted: 16 Feb 2018 04:19 PM PST

    I am trying to solving an RSA problem in which I have given n,e(public exponent), 2d+phi(n) I want to know how can i find out the value of d. for values go to link:- https://pastebin.com/mdeSdfzD

    submitted by /u/ankitsaini2609
    [link] [comments]

    Opinion on this naïve deniability protocol I've come up with

    Posted: 16 Feb 2018 04:48 AM PST

    I'm a begginer on all cryptography stuff. I've read a little on deniability in OTR and in the Signal protocol. I can't understand why the following simple protocol wouldn't work:

    • B has some data that it wants to make public to anyone, but the act of making it public may be illegal, so it can't put it on some website in the open;
    • A wants to fetch data from B, B doesn't want A to publish the data later and prove it was sent from B;
    • A knows B's public key, B knows A's public key;
    • B generates a keypair T;
    • A sends a REQUEST to B, encrypted with B's public key and signed with its own private key, in the REQUEST, B includes one of the T keys;
    • B sends a RESPONSE back to A, encrypted with A's public key and signed with the T key;
    • A can verify the response came from B because only B could have had access to the T token;
    • A can't prove the message was sent by B, since A could have forged the message himself, or sent the same T key to other people.

    The idea is that A doesn't have to be trusted in any sense before B sends data to it, it can just send the data to anyone who REQUESTs it.

    submitted by /u/fiatjaf
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment