Cryptography A proposed API for full-memory encryption |
- A proposed API for full-memory encryption
- The year in post-quantum crypto (DJB and Tanja Lange)
- CipherSweet: Searchable Encryption Doesn't Have to be Bitter
- A fake shitty twitting on such a winter`s day - shitcoinoffering
- Our PHP Security Roadmap for the Year 2019
- Disabling insecure Let’s Encrypt validation will cause broken HTTPS setups for Debian and Ubuntu users
- RSA / ECDSA
- Modelization of the entropy of randomness bias
- [Hiring] Staff Cryptography Engineer @ Mozilla
- What Type of Key is this
- LibHydrongen maximum message length?
A proposed API for full-memory encryption Posted: 31 Jan 2019 07:33 AM PST |
The year in post-quantum crypto (DJB and Tanja Lange) Posted: 31 Jan 2019 07:49 AM PST |
CipherSweet: Searchable Encryption Doesn't Have to be Bitter Posted: 31 Jan 2019 10:08 AM PST |
A fake shitty twitting on such a winter`s day - shitcoinoffering Posted: 01 Feb 2019 01:06 AM PST |
Our PHP Security Roadmap for the Year 2019 Posted: 31 Jan 2019 10:37 AM PST |
Posted: 31 Jan 2019 05:17 AM PST |
Posted: 31 Jan 2019 05:03 PM PST I imagine a dark room where only sound can be applied for interaction with others in the room, you can communicate, but you do not know from where sound is coming. Which is a thing I need to accomplish ( permission less anonymity for both, service and the user). It should be a decentralized network which for assignment have to anonymize services and users like dark room example above. RSA public key would be an ip address(hash of it) and key for encryption to send message to owner of the key(address). Each message will be encrypted with RSA key, depends to who and who is sending the message so only the sender and receiver know the content of message. I know that RSA is slow, but security should be choose over an network speed in this case. Since public key of each node in the network will be available to most of the network, do you think RSA is still strong enough for this purpose? [link] [comments] |
Modelization of the entropy of randomness bias Posted: 31 Jan 2019 11:28 AM PST Hi (slightly misleading title to keep it short), I'm trying to reason about a random token that has a bias in order to know how many bits of security it may represent. Let's say a 16 bit key to keep it simple. If perfectly random it has 16 bits of security. If I know that 80% of the time the first digit is a 1, how many digits of security can I say it has? 15.2? 15.8? That doesn't seem right to me to just say that you lose or gain 80% of a bit although it seems the most natural, a bit known at 100% and you lose exactly 1 bit. There can also be more complicated situations, such as "I know that the last two bits are the same 80% of the time", how would one represent that? The topic of randomness bias is an old one and I guess that angle has been discussed before but I couldn't find any reference on the topic. [link] [comments] |
[Hiring] Staff Cryptography Engineer @ Mozilla Posted: 31 Jan 2019 07:12 AM PST |
Posted: 31 Jan 2019 09:21 AM PST Hey this is a Public Key for Verification of a signature.
It's 96 bytes long with the first four bytes being
And this is the function to turn it back to an Array Buffer.
Does anyone know a good way to determine what method of encryption was used to form the key. [link] [comments] |
LibHydrongen maximum message length? Posted: 31 Jan 2019 09:11 AM PST |
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