mircea_popescu: to encrypt : take plaintext message M, no longer than 250 bytes, and zero-pad it to 250 bytes. take pile of random bits R 250 bytes long. calculate X = M xor R. calculate Y = R xor MPFHF(X) set for R.len = 250 bytes. RSA the 500 byte pile of X || Y. done. to decrypt : de-RSA the 500 byte pile. cut it in two halves. calculate R = Y xor X. calculate M as X xor R. done. ☟︎

mircea_popescu: (the rsa forgery comment was re sig ^ e mod n || sig mod n always verifies as validly signed.)

mircea_popescu: if they're not there, any historical trace of a ps -eo cmd,args | grep "mysql" (or the same command run on a similar system) will provide a -datadir= string.

mircea_popescu: | | | | PROXIMITY || || || | CLOSURE ][ ][ ][ ] DESTINY >>>>>>> CONTINUITY —|—|—|— Modus Ponens is made of this… To achieve mastery of Gestalt self-programming you must start using the method of mentat computation (after Frank Herbert, of course) that I describe in the paper in this link:"

mircea_popescu: ohohoh this is pure gold. "To achieve this, you must first study the Gestalt laws and learn to Gestalt-program your own mind. For, we are self-programming Gestalt-computers, Stanislaw. Relax and look at these five patterns while sensing their perceptual force. Note how they are self-defining in any language. Through perceptual induction they govern all the logical deductions that you will ever be able to make:SIMILARITY | | |

mircea_popescu: http://btcbase.org/log/2017-07-22#1688972 | http://btcbase.org/log/2017-07-22#1688963 wut do you both see in random club slut like ~any other ?! this is interesting already. ☝︎☝︎☟︎

mircea_popescu: (echo "obase=16" ; cat fct.txt) | bc >> fact-hex.txt works as expected to convert btw.

mircea_popescu: what happens if i do data like "1 byte|fff|2bytes|fff" ?

mircea_popescu: what happens if i do data like "1 byte|ff|2bytes|fff" ?

mircea_popescu: 2017-07-08 00:06:58|delivered_by:sina|sender:sinatron|hello worl

mircea_popescu: 2017-07-08 00:06:57|delivered_by:self|sender:urmom|ugachuga