I mean what's the real point you are arguing? I'm happy to include other datasets in the master database. A bigger database is no problem for this schema or SQLite limitations.
The LLM produced all these things with one or two prompts and they are all grammatically valid... It's just what I happened to source the initial data set from.
I used a LLM to create my database because it is not only a collection of words, but common phrases. Plus not only can the LLM format the database how I want it so it's interpretable to the program, it can build the database and included all the appropriate amount of duplicates.
The fact that you completely ignore that simply using a larger RSA key would both be faster and more secure than your approach, doesn't inspire confidence either.
The goal was to not use any modern crypto... Codebooks have been used for a very long time and are secure with proper key management.
This is an attempt at a modern codebook. It tackles most all of the shortcomings of previous iterations.
(It's also in python which is basically unusable. )
Haha.
What motivated you to write this program?
Just for fun basically.
I've had the idea for awhile but the problem is was always a huge amount of grunt work to get the initial database created. With the use of LLM I basically mined all the unique entries, common phrases.
I'm not claiming it's the best or anything at all. But for codebook standards...I tried to implement all the things that would make a good code book.
The script compiles a home directory with all the pieces and parts to run a webserver.
The script updated and installs these packages.
$PIP_BIN install --no-cache-dir flask sqlalchemy pillow itsdangerous werkzeug gunicorn
pkg install -y python python-pip tor clang libjpeg-turbo libpng openssl gnupg
There are really two categories to "war resistance". Did this war completely knock out the internet? Then your limited to satalite, meshtastic, physical radio tech.Maybe jack dorseys bitchat would work since everyone will already have the hardware to build the network out.
If you have internet...then Tor, I2P, and other overlay networks will remain very resilant and allow you to communicate over any distance...that's what it was made for.
Severing fiber connections between Sweden and central Europe won't matter to Tor. It's whole job is to make secret unblockable tunnels.
Agreed, flock is no longer a startup they are coming up on 10 years.
There has been some big in depth right ups and coverage, but alot of the coverage is small town news orgs documenting the presence.
The biggest thing to be watching is the Institute for Justice lawsuit vs city of Norfolk.
If they are successful it will have large implications across the US.
I'm definitely in that category of misconception where I would assume adding extra bits of information before encryption may help the strength of the encryption somehow but it really doesn't at all I guess.
Yeah I don't know who the poster is, but the original is posted on the lemmy.ml instance. I think it's a bot maybe attempting to federate non federated content or something? I don't really understand how it ends up on the programming.dev instance.
It for that limited scenario where you want to send a image but all you can send it text
Your right. That isn't doing anything except effectively lowering image quality potential since it's just adding extra data for no reason.
I should update so it's only running base64 after...that's just so it's easily copypastable
It looks very similar to the flock condor. The black box looks like a flock compute box but I'm not sure.
Maybe, but I could see the university pd as a prime org to run your investigations through as a proxy.
They aren't going to be beholden to a city council or anything
I do want to reply because I think my claims are reasonable.
The only actual cryptographic function for the schema is the secrets.randbelow(). Scrutinize this function if you don't think it can achieve what I am claiming it can.
The randomize function takes each ID and assigns it a new integer. This is taking entropy at the OS level. There are no seed values used here. It's never going to repeat in a billion years. Because there are 2million+ entries, the amount of possibilities are essentially limitless. You could stack 1 petabyte drives across our entire universe and still would not be able to capture every possible state.
This function is highly documented and (as far as I know) is the one of the best available CSPRNG you can actually utilize on a device.
Here is an example of the raw shuffle map that is generated.
Before the shuffle map is loaded, if you query your word, your going to get the raw unshuffled associated message ID.
Once a shuffle map is generated and loaded into the program the query is simply looking for the new CSPRNG assigned integer.
The shuffle map can now be considered the key. Because this is a pure lookup table, there is no algorithm to attack aside from guessing how my exact device generated the shuffle map in it's exact moment of existence....that's where the strength of this schema lies.
Thanks for the discourse I've enjoyed the pushback despite we can't agree.
Edit*
Take a look at the new pack62 compression though!