Cross-posting from /g/, since I don't expect a lot of answers there.I attend a cryptography course at uni. The subject of the last lecture is up for discussion.So far we've seen groups, Pedersen commitments and RSA digital signatures. What's left is ElGamar encryption and zero-knowledge proofs. Some choices for the last lecture are:- Groups from Elliptic Curves (construction method, space and time costs, support for bilinear mappings).- One-time signatures from hash functions (Lamport, WOTS, resistance to quantum computer attacks).- Signatures (EC)DSA and Psychic Signatures (including a brief discussion of implementation issues).- Secret Sharing, multi-member signatures (Shamir Secret Sharing).- Electronic Voting (commonalities with the above).- Lattice-based cryptogaphy.What do you think would more interesting/useful from the above? Do you have any other suggestion?
>>16146999> - Secret Sharing, multi-member signatures (Shamir Secret Sharing).Usefull!
>>16146999nist backdoors and unexplained constants
>>16147047This is an interesting topic, will research it on my own. But since we mainly examine the theoretical protocols themselves and not any implementations/real world systems, I don't think it would be a good contender. But thank you very much for your suggestion.
Why the fuck are bob and alice always messaging each other? Aren't they both married? Do their respective partners know how long this has been going on?
secret sharing is very useful and fun but it's not too complex so you can learn it on your own (create a polynomial of degree n-1 where n is the number of parts of the secret you desire to be required to reconstruct the message, plug in the values to create shadows/keys, share the keys with the recipients and it'll all work out that 'n' recipients will need to combine their keys to solve M by eliminating variables like any other polynomial)I would personally have a lecturer explain elliptic curves since they're pretty math heavy but are commonly used
>>16147610>where n is the number of parts of the secret you desire to be required to reconstruct the messageI explained this badly, n is the number of keys that you want to recombine to reconstruct the message. shamir secret sharing is given in the form (n,m) where n is as stated and m is a value > n of the number of total shadows you want to create
