Zero-knowledge identification not by n = p*q?

Question

Mathematics

The essence of the question is that it is necessary to identify the two parties A and B according to the protocol with zero knowledge. I thought to use either the Fiat-Shamir protocol or Gillu-Kiskatra. But it produces n = p * q, where p and q are simple. This is not very convenient, you need to identify by any sequence of numbers and letters.
If we use the indicated two algorithms, then what is the best way to convert a numerically alphabetic sequence into a numerical one, and then how to get a prime number from it? I use Python, if someone sticks their nose into the library, it will be very good.