An algorithm that produces ciphertext such that no matter how much ciphertext is available, there is not enough information in it to determine the plaintext that produced it$,$ is called a$($n$)$:

Question $114$ options:

exceptionally secure cryptosystem.

unconditionally secure cryptosystem.

one$-$time pad.

provably secure algorithm.