Post by Stefan ClaasPost by Richard HarndenPost by Stefan ClaasPost by Stefan ClaasPost by Richard HarndenPost by Stefan ClaasCreate your OPT message, consisting of digits, like usual. Once
done create a harmless story, with a couple of sentences. The
word count of each sentence represents a digit in the OTP message.
Once Bob receives the story from Alice he simple counts the words
in each sentence and writes down the digits, so that he later can
decrypt, with the exchanged pads, the story.
You can let AI, like Bing, write the stories and tell it how many
words per sentence must be in the story. I did this once
successfully. :-)
That isn't random, so isn't a OTP at all.
Excuse me, you create random pads as usual and the OTP messages as
usual, which is random and from the ciphertext digits you create
with the help of AI your story.
<https://rijmenants.blogspot.com/2014/12/wps-secret-numbers-in-letters.html>
I'm not sure what you're trying to do, then.
Combining a OTP with steganography is just going to make the pad much
longer. And the reason OTPs aren't used is that they are difficult
to securely exchange, mostly because they are too long.
Aren't you making the problem worse?
Ok, I must admit that the OP's thread was about 'Patterns', but I
Of which I still highly suspect that the doctor was simply trolling.
Post by Stefan Claasreplied to Chris, showing another way.
I somehow doubt that we can create proper (i.e. long) cipher text
consisting of a pattern, shown by the OP, in form of software and
that it can be reused with other plain code messages. I can be wrong
of course and would like to see such a solution.
Presuming "the doctor" was not actually trolling (99% probability it
was a troll) then the doctors question was "what algorithm was used to
encrypt". Of course the simplest answer is: "unknown, insufficient
information provided to answer that question".
But, presuming one, for some reason, did want a message to 'ecrypt' to
the doctor's original pattern, then one has three choices to obtain
such:
1) brute force try keys and/or inputs to a selected algorithm until
finding a key/input which results in that specific output. This choice
is likely to take a nearly infinite amount of time.
2) analyze the mathematics of a selected algorithm sufficient to be
able to select a given key and input which would result in the doctor's
output. This would also possibly take significant time, but if one
succeeded here, one would also likely have a paper worthy of
publication and also likely have found a significant break of the
selected algorithm.
3) use the OTP algorithm, and fashion one of either a special OTP that
converts a given message of exactly the output length into that output
or fashion a special message that for a given OTP creates that output.
This is the route that is the quickest, because fashioning either the
"special OTP" or the "special message" is simply bitwise xor of the
doctors output with a selected message (to create a special OTP) or
with a given OTP (to create a special message).
4) create a custom "algorithm" that "encrypts" the message to that
output. This option is little different from #3 beyond it uses "custom
algorithm X" instead of the OTP algorithm.
Therefore, given the lack of information in the doctors initial post, a
reasonable "possible encryption algorithm" to 'create' that output
would be an OTP with specially crafted message or pad.