Cryptography MIT’s tool for tracking police surveillance: A cryptographic ledger |
- MIT’s tool for tracking police surveillance: A cryptographic ledger
- Multiparty random number generation?
- The Map of Bitcoin ATMs Around the World
- Tutanota claims they will use an api to add interoperability between their AES based system and OpenPGP - any idea how this would work? Can anyone explain their search system? Thanks.
- Looking for good cryptography math Discord / Slack / Chat Groups?
- HMAC optimization - slight performance improvements through precomputation
- Padding Oracle attack against Telegram Passport
- New encryption system [Seeking testers]
- It appears, that there are the same cardinality of integers as permutations of integers, and here is the 1 to 1 mapping
- Awesome Quotes about Mathematics (and related fields)
| MIT’s tool for tracking police surveillance: A cryptographic ledger Posted: 07 Aug 2018 11:57 PM PDT |
| Multiparty random number generation? Posted: 07 Aug 2018 09:40 AM PDT Suppose N parties wanted to generate a random number but a party might benefit if the number wasn't chosen randomly. For example, consider an online roulette game. The client (betting party) and the server need to agree on a random number but the client would want the number to be the one that they placed their bet on and the server would want that not to be the case. Obviously this could be worked around with a commitment scheme but that would not be exactly the same as a real roulette wheel. So suppose the advantageous results couldn't be concealed with a commitment scheme. Maybe the parties are playing a secure game of D&D online (secure, hypothetical, and yes, a bit silly). In real life, a party might roll a d20 to see if an attack hits the opponent. In the online scenario, the DM doesn't trust a player character to be honest about rolling and the player doesn't want to forfeit the right to roll completely so they want a scheme whereby they can both agree that the roll was chosen fairly. Is there a scheme that would provide this? That is, is there a multiparty random number generator where the parties can have some guarantee that no party is "rigging" the randomness? (This is just a hypothetical scenario I was thinking about. I'm not trying to implement anything; I'm just curious if something like this exists and where I might be able to read more about it. Thanks!) Edit: Thanks everyone for the responses. I've got a bit of reading ahead of me, which is exactly what I wanted! [link] [comments]  |
| The Map of Bitcoin ATMs Around the World Posted: 08 Aug 2018 02:08 AM PDT |
| Posted: 07 Aug 2018 07:46 PM PDT https://tutanota.uservoice.com/knowledgebase/articles/470724-why-does-tutanota-not-use-pgp No details. https://tutanota.com/blog/posts/first-search-encrypted-data Any idea what they mean by "index?" [link] [comments]  |
| Looking for good cryptography math Discord / Slack / Chat Groups? Posted: 07 Aug 2018 07:13 PM PDT I am interested in crypto however am having struggles with understanding some of the notation. I would appreciate suggestions or invitations for discussion groups so I can ask seek help! It's hard to google search cause always get cryptocurrency results not math related [link] [comments]  |
| HMAC optimization - slight performance improvements through precomputation Posted: 06 Aug 2018 01:52 PM PDT |
| Padding Oracle attack against Telegram Passport Posted: 06 Aug 2018 02:16 AM PDT |
| New encryption system [Seeking testers] Posted: 07 Aug 2018 05:37 AM PDT Hello r/cybersecurity, r/cryptography and r/crypto, I am reaching out to you on behalf of a company that has requested to stay anonymous. They have developed a new encryption system, and are seeking testers with knowledge of Cyber security and/or Encryption. How the system works? This encryption system works with dynamic variables and algorithms. It encrypts data by randomly selecting an algorithm and other mathematical variables. Then, it applies this data in order to generate a 1 out of 10,000 possible outcomes of the selected algorithm. it then links and locks the hash to the requesting server so that it cannot be verified or used on any other platform, it is important to note that This encryption system does not store any data before, during, or after this process. When This encryption system verifies data and there is an absolute match, it generates a new hash and returns the new hash to replace be updated in the Database. How is it different from others? This encryption system is very different from any other one-way encryption system out there, unlike others This encryption system does not use or require a salt to protect data efficiently. This encryption system uses randomly dynamic generated algorithms and variables to encrypt data of which each algorithm allows at least 10,000 possible different outcomes, without any salts or stored data. And unlike others, This encryption system relays on Hard Drive space to become more powerful. In example: 1GB of storage would allow the system to output 322,580,640,000 different hashes, per website, per user. I hope this post has peaked some of your curiosity. If you would like to participate then please send me a message. Thank you for taking the time reading this post. [link] [comments]  |
| Posted: 06 Aug 2018 05:28 PM PDT WAIT, appears the quantity of things being permutated leaves some duplication with other such quantities, but still... using only nonnegative integers... Define an integer as an bitstring, appending a 1 as highest bit. Every positive integer is here. For each bit index x from 1 up to infinity, swap 2 bits, this bit and a random bit index 0..x. This algorithm for generating a random permutation has been around for a long time. In each of these 0..x, multiply by the size of that range, so you get 0..factorial(x) (may be off by 1 in some of these, but you get the idea). After choosing 1 of those (0..x) it is removed from those things being permutated, leaving a smaller list of things being permutated, so x-1 chooses the next to remove, and so on until theres only 0 to remove. The integer 0 is permutations of 1 thing. The integers 1-2 is permutations of 2 things. The integers 3... are permutations of 3 things... These are simply an ordering of permutations. If every possible permutation of the first n bits is covered, then there are n+1 times that many permutations of n+1 bit vars. Since there are equally many integers as permutations of integers (though permutations are factorial as high), P != NP. [link] [comments]  |
| Awesome Quotes about Mathematics (and related fields) Posted: 06 Aug 2018 05:24 AM PDT Hello all! If you're the kind of person who enjoys quotes about the beauty or nature of mathematics, physics, computer science, etc., then I've made just the place for you! The sub /r/MathQuotes was made with the idea of gathering people together who enjoy non-trivial quotes (to see what I mean by non-trivial, check out the sidebar and the quotes on the page). I expect this sub to grow into the kind that doesn't flood your feed, but rather gifts your feed with occasional nuggets of wisdom, with the hope of bringing you joy. Who knows, maybe you'll be able to bring the same joy to someone else the next time you come across a neat quote, if you so decide to post it there! :D -Foobanana (the real one) P.S. - As usual, when I advertise on a sub, I trust the moderators and subscribers to kick my ass if my posts are deemed as spammed. [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