# Is permutation conjugate search problem many answer? Are there many answer equal? [closed]

If conjugate search problem of permutation is difficult , then there are next cryptosystem will appear.

A=XYX−1,B=XZX−1,Y and Z are public key.And X is secret permutation. then encryption is C=YZZYZYYZY... at random,and D=ABBABAABA follow to C. c=H(C)+m. Bob send D and c as cipher text.

decode Alice calculate XDX−1=C,and m=H(C)+c,m is plain text.

Is this cryptography insecure?

• Hmmm.. fairly unreadable – Chipotle Jul 30 '19 at 14:34
• Please refrain from editing a question to completely change its meaning after answers have already been posted and accepted. – Ella Rose Aug 6 '19 at 14:05

As I pointed out in my answer to Is Permutation conjugate problem hard? , finding an $$X$$ given permutations $$A, Y$$ such that $$A = XYX^{-1}$$ is an easy problem.
Finding an $$X$$ that satisfies both $$A = XYX^{-1}$$ and $$B = XZX^{-1}$$ simultaneously should not be any more difficult (you can use the same base algorithm to search through both equations at the same time).