In order to count as non-broken, an encryption algorithm must already be secure against a distinguishing attack. All you need to do is grab a non-broken algorithm, and stick your cyphertext in a place where you can expect to find random junk anyway. Like the least significant bit of an image or frame of a video. This is the standard obvious thing that everybody has known about since forever.
I fail to see why you would need to improve upon this way.
cas-san-dra t1_jbbe9a0 wrote
Reply to A group of researchers has achieved a breakthrough in secure communications by developing an algorithm that conceals sensitive information so effectively that it is impossible to detect that anything has been hidden by thebelsnickle1991
In order to count as non-broken, an encryption algorithm must already be secure against a distinguishing attack. All you need to do is grab a non-broken algorithm, and stick your cyphertext in a place where you can expect to find random junk anyway. Like the least significant bit of an image or frame of a video. This is the standard obvious thing that everybody has known about since forever.
I fail to see why you would need to improve upon this way.