Security of permutation function

49 Views Asked by At

I have a question related to permutation. If I have a 10-bit number: {0101110010}. I want to swap even position bits to adjacent odd bits and odd positions to adjacent even bits, such that I get {1010110001}. Can I call it an alternate permutation?If I use it for a security purpose such that the any other party finds hard to get a correct sequence, so is it secure enough to be used? Thanks