IPG Algorith Broken!

[Igor Chudov @ home]

paul at fatmans.demon.co.uk wrote:
> Perfect is a better term. Strictly speaking it is because there is no 
> finite unicity distance (the amount of ciphertext with which the 
> cipher can theoretically be broken). So, stricly speaking, for a given 
> message C and a prospective pad, P, out of a set of N pads which may 
> or may not be correct:
> 
> P(P|C) = N^-1

What does it mean?

	- Igor.