Cryptography Authenticate the Solitaire cipher? Any generic approaches to hand message authentication? |
- Authenticate the Solitaire cipher? Any generic approaches to hand message authentication?
- Creating a new key pair
- how difficult would it be to break a button-mashing code that's TREE(3) digits long?
- Babble consensus overview
| Authenticate the Solitaire cipher? Any generic approaches to hand message authentication? Posted: 05 Sep 2018 02:22 PM PDT It appears that the Solitaire cipher is not authenticated. As such, I was curious what I could do to authenticate it. A friend of mine on IRC had the idea to try a CBC-MAC approach, so I threw up something quickly where during encryption the ciphertext of the previous character is summed modulo 26 to current plaintext character, after which the key is applied addition modulo 26 to find the current ciphertext character. Something like this: He also brought up, however, that the state of the deck is not being changed via the MAC, as the Solitaire cipher is an output-feedback mode stream cipher. Could this approach be extended to modify the state of the deck, or is that unnecessary? Further, could a generic authentication approach be created, such that it could be applied to other hand ciphers, such as the Chaocipher, which is a dynamic substitution "autokey" cipher? Or is the Chaocipher already authenticated by way of the algorithm? Assume my adversary is my next-door neighbor who might know a thing or two about mathematics, known plaintext attacks, and ciphertext malleability. If my adversary is a state actor, I'm using Signal. I'm just curious about this from a learning standpoint about how authentication could be applied to hand ciphers, rather than actually advocating their use in general. EDITED: Cleaned up the calculation formatting. [link] [comments]  |
| Posted: 05 Sep 2018 09:53 AM PDT I revoked an old key pair which has been uploaded to keyservers. Would there be any negative impact if I create a new pair? Reputation-wise, identification, indexing, etc? Or is there a way to un-revoke a key pair? - it may be apparent that I'm still an idiot at this sort of thing [link] [comments]  |
| how difficult would it be to break a button-mashing code that's TREE(3) digits long? Posted: 05 Sep 2018 01:33 PM PDT |
| Posted: 05 Sep 2018 05:07 AM PDT FAQs which briefly acquaint us with Babble consensus.
Babble combines the advantages of an asynchronous DAG protocol with the benefits of a blockchain's linear data structure. The former makes it possible to achieve low latency, high throughput, asynchronous, and leaderless consensus. The latter enables Babble-powered blockchains to interface seamlessly with any application and to communicate with other blockchains via Inter-Blockchain Communication protocols.
Hashgraph is a form of Directed Acyclic Graph that cryptographically records the history of gossip. Gossip protocol is in the foundation of Babble. However, Babble takes this data structure one step further and maps ordered transactions into a blockchain format.
Key advantages of Babble consensus are speed, throughput, fault-tolerance, absence of leaders, and pluggability. Read the high-level overview of Babble consensus in the article: https://medium.com/monet-network/babble-consensus-d2a8065ca13d Learn more about using Babble consensus and Babble blockchain in Monet in its whitepaper. [link] [comments]  |
| You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment