Simplify the following text for a Grade 10 native English-speaking person.
Original: It is also a proof that all theoretically unbreakable ( un-crack-able ) ciphers must have the same requirements as the one-time pad encryption algorithm .
Simplified: It is also a proof that all theoretically unbreakable ciphers must have the same requirements as the one-time pad .