• Breaking News

    Friday, September 7, 2018

    Home Unlabelled Cryptography Curve-Vis: A small tool for searching and printing Edwards-curves over actual finite fields. (Only suitable for educational purposes!)

    Cryptography Curve-Vis: A small tool for searching and printing Edwards-curves over actual finite fields. (Only suitable for educational purposes!)

    September 07, 2018

    Cryptography Curve-Vis: A small tool for searching and printing Edwards-curves over actual finite fields. (Only suitable for educational purposes!)

    Curve-Vis: A small tool for searching and printing Edwards-curves over actual finite fields. (Only suitable for educational purposes!)

    Posted: 06 Sep 2018 02:18 PM PDT

    Gcrypt and eddsa ed25519 for digital identity question

    Posted: 06 Sep 2018 03:24 PM PDT

    I want to use gcrypt library for eddsa ed25519. I want use it for identification(identity) of message sender in IM program. Are there known issues with this library and eddsa ed25519 for such use case?

    Is there better solutions? Sodium? Why I interested in gcrypt, because it seems gcrypt not much common in use, and also have sha3 implementation. What bothers me is relative small key length(32 bytes private part).

    Are viable approach to use multiple keys/signatures for one identity to harden it? So just sing one message with two keys for example?

    Also I was researching possibility to use ed25519-dalek rust library, but did not find any information about binary package of it with ffi interface.

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

    What's the problem with DakaRand/TrueRand/TwueWand?

    Posted: 06 Sep 2018 11:40 AM PDT

    So, I recently came across DakaRand. This is a revisit to an idea from 1996 called TrueRand, and purports to be a TRNG implemented in software. This sounded like voodoo magic to me at first (and maybe it is), but the algorithm runs like this:

    function randomBit: t = GetCurrentTime() + 1 bit = 0 while(GetCurrentTime() < t) bit = !bit return bit

    DakaRand whitens the output to produce an unbiased bitstream, which I'll leave out because all the entropy comes out of randomBit and that's the interesting part.

    The output of randomBit depends on whether an odd or even number of bitflips happened before the next millisecond passed. The argument for why this works seems to be that there is uncertainty in how many instructions the CPU will process in this interval, created by everything from variation in the oscillators, to competition for access to peripherals like the RTC.

    I don't know nearly enough about what's happening at such a low level to understand whether or not we actually get entropy this way.

    It is a very slow source, and takes hundreds of milliseconds of CPU utilization to generate something like a 128-bit key. Performance aside, does this technique actually produce a working TRNG?

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

    I'm starting a new digital signature system (JUDSYS-1)

    Posted: 06 Sep 2018 06:16 PM PDT

    Hi!

    ​

    I have recently started a project to create a spec and end user implementations of a new digital signature system. I am still on the very begging.

    ​

    Any comments and suggestions are welcome!

    ​

    Project website: https://judsys.github.io

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

    Hey guys. New Rust Programmer here. Got a question about tamper-proof data transfering.

    Posted: 06 Sep 2018 09:50 AM PDT

    Hello.

    I have an application that will pass data consecutively. Data will be produced and go from computer 1 who will pass it on to computer 2 who will pass it on to computer 3 and so on.

    The only issue is that computer 3 needs to get the data in a tamper-proof way. What I have decided is I can use a library like this:

    https://docs.rs/openssl/0.10.4/openssl/rsa/index.html

    Share a public key with all clients and the first computer will keep the private key. Then encrypt data with public key and pass it on. ( I don't mind if computer 2 can see data btw, I just need to guarantee tamper-proof)

    Could someone show me a piece of code with that library that does this with the most modern algo? or any advices?

    My plan was to encrypt with a generated private key on the starting computer and decrypt with a public key on each other computers one by one. Since I'm using an actual library where trusted people implemented this, should not be a problem right?

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

    post-quantum encryption app with GUI available ?

    Posted: 06 Sep 2018 04:35 AM PDT

    Hi, i know of NTRU and McEliece as PQ algorithms, but they're not that user-friendly to set up. Any pq algorithm that is usable right now and has a GUI for the noobs ?

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

    Is a Private Messenger viable?

    Posted: 06 Sep 2018 10:23 AM PDT

    I was reading through some articles and thought of the idea of a decentralized P2P messenger that could exist with some degree of privacy, is something like this actually safe?
    r/https://medium.com/adamant-im/adamant-security-features-e7cc836ff52c

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

    No comments:

    Post a Comment