Given a password as a seed for a Psuedo Random number generator and Fisher Yates Algorithm to shuffle bytes of a string to random places like Hello World to ldWoeHor ll, is it practically and/or theoretically impossible to break such cipher if plaintext contains enough words like >100?
Like for example, a string is shuffled and cipher generated is tca, if cryptanalysist tries to find dictionary words, he might get act or cat but he cannot be sure which one is right. Similarly bigger strings would have more such possibilities like trillions so it would be just too expensive to crack such cipher.
