cryptography (noun). The discipline concerned with communication security (eg, confidentiality of messages, integrity of messages, sender authentication, non-repudiation of messages, and many other related issues), regardless of the used medium such as pencil and paper or computers.
This community is for links about and discussion of cryptography specifically. For privacy technology more generally, use !privacy.
This community is explicitly not about cryptocurrency; see !crypto for that.
-
Cryptography @lemmy.ml A1kmm @lemmy.amxl.com Project Uniquonym - a concept (not yet implemented) for coupling pseudonymity with limits on sybil attacks / astroturfing
lemmy.amxl.com Project Uniquonym - lemmy.amxl.comA public log of ideas and investigation results for Project Uniquonym, a conceptual open protocol for allowing people to create zero-knowledge proofs that they only have one pseudonym, without revealing their real identity.
I'm logging my idea across a series of posts with essays on different sub-parts of it in a Lemmy community created for it.
What do you think - does anyone see any obvious problems that might come up as it is implemented? Is there anything you'd do differently?
There are still some big decisions (e.g. how to do the ZKP part, including what type of ZKPs to use), and some big unknowns (I'm still not certain implementing TLS 1.3 on TPM 2.0 primitives is going to stand up and/or create a valid audit hash attestation to go into the proof, and the proofs might test the limits of what's possible).
-
Cryptography @lemmy.ml OCTADE @soc.octade.net GOLDILOCKER Brain Wallet - Generate OpenSSL Goldilocks Elliptic Curve Keys from Seed Phrase
GOLDILOCKER Brain Wallet - Generate OpenSSL Goldilocks Elliptic Curve Keys from Seed Phrase
https://codeberg.org/OCTADE/goldilocker
Goldilocker is a brain wallet application for generating ED448 encryption and signing keys via OpenSSL.
Encryption keys may be stored offline as a complex passphrase or a seed phrase generated from the BIP39 word list.
-
Cryptography @lemmy.ml OCTADE @soc.octade.net KSRNG - Key Strike Random Generator (version 0.0.1)
KSRNG - Key Strike Random Generator (version 0.0.1)
https://codeberg.org/OCTADE/keystrike
KEYSTRIKE generates very, very random seeds that are truly random.
KEYSTRIKE uses /dev/urandom and several TRNG mixing techniques:
keystroke timestamps, doubling and shuffling, modulus and size
truncating.The final output is a whitened, true random and pseudo-random mix.
-
Cryptography @lemmy.ml OCTADE @soc.octade.net MEGARAND Extreme Overkill Random Seed Generator
MEGARAND Extreme Overkill Random Seed Generator
https://codeberg.org/OCTADE/megarand
MEGARAND employs extreme overkill in the genration of a very large entropy pool. The output is extremely random as a result of several hashing, timestamping, shuffling, encrypting, and truncation techniques. MEGARAND is useful for generating large seed bases for key and passphrase material or for feeding to cryptographically secure PRNG software if high-speed outputs are required.
-
Cryptography @lemmy.ml OCTADE @soc.octade.net Hexlish Alphabet for English, Constructed Languages and Cryptography: Automatic, Structural Compression with a Phonetic Hexadecimal Alphabet
Hexlish Alphabet for English, Constructed Languages and Cryptography: Automatic, Structural Compression with a Phonetic Hexadecimal Alphabet
DOI : https://doi.org/10.5281/zenodo.13139469
Hexlish is a legible, sixteen-letter alphabet for writing the English language and for encoding text as legible base 16 or compressed binary. Texts composed using the alphabet are automatically compressed by exactly fifty percent when converted from Hexlish characters into binary characters. Although technically lossy, this syntactic compression enables recovery of the correct English letters via syntactic reconstruction. The implementer can predict the size of the compressed binary file and the size of the text that will result from decompression. Generally it is intuitive to recognize English alphabet analogues to Hexlish words. This makes Hexlish a legible alternative to the standard hexadecimal alphabet.
-
Cryptography @lemmy.ml Jaromil @fed.dyne.org LatticeGen: how to hide LLM conversations for Privacy-Aware Cloud AI
arxiv.org LatticeGen: A Cooperative Framework which Hides Generated Text in a Lattice for Privacy-Aware Generation on CloudIn the current user-server interaction paradigm of prompted generation with large language models (LLM) on cloud, the server fully controls the generation process, which leaves zero options for users who want to keep the generated text to themselves. We propose LatticeGen, a cooperative framework in...
-
Cryptography @lemmy.ml Arthur Besse @lemmy.ml NIST Announces 14 Candidates to Advance to the Second Round of the Additional Digital Signatures for the Post-Quantum Cryptography Standardization Process
csrc.nist.gov PQC Digital Signature Second Round Announcement | CSRCNIST publishes NIST Internal Report (IR) 8528, Status Report on the First Round of the Additional Digital Signature Schemes for the NIST Post-Quantum Cryptography Standardization Process.
full text of post:
After over a year of evaluation, NIST has selected 14 candidates for the second round of the Additional Digital Signatures for the NIST PQC Standardization Process. The advancing digital signature algorithms are:
- CROSS
- FAEST
- HAWK
- LESS
- MAYO
- Mirath (merger of MIRA/MiRitH)
- MQOM
- PERK
- QR-UOV
- RYDE
- SDitH
- SNOVA
- SQIsign
- UOV
NIST Internal Report (IR) 8528 describes the evaluation criteria and selection process. Questions may be directed to [email protected]. NIST thanks all of the candidate submission teams for their efforts in this standardization process as well as the cryptographic community at large, which helped analyze the signature schemes.
Moving forward, the second-round candidates have the option of submitting updated specifications and implementations (i.e., “tweaks”). NIST will provide more details to the submission teams in a separate message. This second phase of evaluation and review is es
-
Cryptography @lemmy.ml pancake @lemmygrad.ml FHE-RAM-based message routing
I have been thinking about implementing this for quite some time, but I would like some feedback from people more knowledgeable than me on the matter.
There's been some great progress in the field of Private Information Retrieval (PIR) protocols. Recently, in a 2022 article, Lin et al. describe an "updateable DEPIR", with both read and write times that can be made sublinear to database size.
I wonder if one couldn't use a combination of this technique and regular public-key cryptography to provide fully anonymous message routing. One could write outgoing messages to a fixed address and issue private reads to their contacts' addresses, with the messages themselves being encrypted with the receiver's public key.
The benefit of this would be a messaging protocol wherein the server wouldn't just be oblivious to the content of all messages, but also the social graph itself, plus all message-sending operations becoming deniable as a side effect.
-
Cryptography @lemmy.ml yo_scottie_oh @lemmy.ml Public Key Cryptography - Computerphile
In this six minute video, Robert Miles explains public/private key cryptography in layman's terms. As a non-expert in this field, I find Miles' explanation very accessible, and I've come back to this video to brush up on this concept several times since the first time I watched it. Enjoy!
-
Cryptography @lemmy.ml positive_intentions @lemmy.ml Encrypted P2P Chat
https://github.com/positive-intentions/chat
Is this a secure messaging app? probably not... but id like to share some details about how my app works so you can tell me what im missing. id like to have wording in my app to say something like "most secure chat app in the world"... i probably cant do that because it doesnt qualify... but i want to understand why?
im not an expert on cyber security or cryptography. im sure there are many gaps in my knowlege in this domain.
using javascript, i created a chat app. it is using peerjs-server to create an encrypted webrtc connection. this is then used to exchange additional encryption keys from cryptography functions built into browsers to add a redundent layer of encryption. the key exchange is done like diffie-helman over webrtc (which can be considered secure when exchanged over public channels). the algorithms are fairly easy to use and interchangable as described [here](https://developer.mo
-
Cryptography @lemmy.ml solrize @lemmy.world Bernstein and Lange -- Safe curves for Elliptic Curve Cryptography
This is a technical but quite informative article, nominally about which elliptic curves have good security properties, but also discusses the intentions behind using EC instead of older systems like RSA (basically, EC is safer against some known classes of attacks).
Posting partly because EC vs RSA came up here a few days ago.
-
Cryptography @lemmy.ml solrize @lemmy.world The government unveils its quantum counter-weapons
cross-posted from: https://lemmy.world/post/18617290
The National Institute of Standards and Technology has finally published the world’s first three official post-quantum cryptographic algorithms, tools designed to protect key systems against future quantum computers powerful enough to crack any code generated by a modern computer.
-
Cryptography @lemmy.ml Settoletto 🍤 @fed.dyne.org Tomb, encrypting your precious data since 2007. Version 2.11 was just released.
github.com Tags · dyne/tombthe Crypto Undertaker. Contribute to dyne/tomb development by creating an account on GitHub.
