Show Navigation
Notices by rtsn (rtsn@gnusocial.de), page 9
-
@damage nice!
-
@lwflouisa finally, also read this; https://www.schneier.com/blog/archives/2011/04/schneiers_law.html
-
@lwflouisa By the way you can't use this as a encryption method since many messages might end up in the same cipher so you can't decrypt it. This is why, if you want to mess with this stuff, you should start off by defining your ideas using proper math, to avoid such easy pitfalls. Just defining things a priori and hope that the idea is sound and secure just because the process "feels" secure will almost never work out. This is stuff is _really_ hard even for professionals. One should start with an appropriate well known hard-to-reverse mathematical process and try to define a cryptographic scheme from that, this is the modern way to think about crypto, not the other way around i.e. just defining processes and hoping for the best. Using a semiformal language like mathematics helps, in other words.
-
@lwflouisa You should probably try to stick to conventional terminology.
-
@lwflouisa what?
-
@kzimmermann guess: you -> vpn -> tor
-
@kzimmermann (unrelated but please start a blog)
-
@lwflouisa Looks like you have to decrypt the full documentation over at rsa.rubyforge.org
-
@lwflouisa I don't know ruby so I can't help you out there. If you are willing to deal with the behemoth known as OpenSSL there's a ruby module for it (OpenSSL implements RSA) but it's hard.
-
@lohang Cool, did you catch anything good?
-
@lwflouisa Exactly what do you mean by splitting a key in two? What properties do you seek?
Suppose you have a msg M encrypted by key K=A+B do you want to be able to decrypt M using only A (or B)? But then, since the algorithm is otherwise is symmetric it follows that M was encrypted with A (or B) so B is redundant information. But I've haven't thought this through very carefully, no coffee yet so I might very well be wrong.
For a "converse"/reversed problem you might be interested in looking up "(fully) homomorphic encryption" and I have a strong hunch that you will enjoy "Shamir secret sharing" as well.
For aes just use good old gpg:
Encrypt: gpg --cipher-algo AES256 --symmetric filename.txt
Decrypt: gpg --output filename.txt --decrypt filename.txt.gpg
-
@lohang what have you been up to?
-
I'm hooked on Project Euler, decided to try to solve things only using C but wow does it take a lot of time, kind of frustrating when the solution is clear in your head and you have to implement it, finally gave up on that and reverted to using python. It's a lot of fun anyways!
-
@lwflouisa >> Can a trapdoor function exist without the underlying code being a public key solution?
Of course, a trap door function is just a mathematical function satisfying some properties, by set theoretic arguments you can show that they are plenty .Not sure what you are looking for though. If you need a non public-key cryptographic solution why not just use something symmetric? AES for example. What is your use case?
-
@chalkahlom I can do anything for a fine cup of coffee!
-
@einebiene I don't think minimalism is for everyone (and I personally don't want to impose it on others). But I really agree with your point on just throwing things away, I sold or gave most of my stuff away, feels a bit wasteful just throwing it in the thrash. Whatever works for you though, there's nothing wrong having a lot of things per se imo. But at least reduction and setting myself in a "minimalist mindset" brings some kind of "clarity" which I find satisfying and slightly anxiety and stress relieving. I also think it's an interesting challenge to ask myself if I really need this *thing* or if it truly add value to me.
rtsn
All Jonkman Microblog content and data are available under the