Which One Time Pad Cipher Would Be "Most Unbreakable" ?

  • Thread starter Thread starter morrobay
  • Start date Start date
  • Tags Tags
    Time
morrobay
Gold Member
Messages
1,116
Reaction score
1,693
Which of the two One Time Pad formats would be most secure ? This one ; https://en.wikipedia.org/wiki/One-time_pad With modular addition or following double key format . Message --> Key -->Key --> Cipher Text
For the same message HELLO. ( Each letter in alphabet is randomly keyed to A --> Z Then again randomly keyed to cipher text. ( repeating message letters are given numbers in first key)
HELLO ------------ message
KWB9J-------------key1
PXNVG------------ key2/cipher text
 
Mathematics news on Phys.org
Since you're using a one-time pad, then it seems that they would be equivalent. One-time pads can't be broken by cryptographic methods since the base values are generated randomly.

However, should someone steal a copy of the one-time pad then the extra encryption would marginally protect the message but over time it would be susceptible to cryptographics methods.
 
For pure cryptographic strength they would be equivalent but for communications channel security an extra level of stream cipher encryption generated from another random key is usually added (superencipherment) to prevent message traffic analysis so there is a random data stream at all times when no OTP cipher text is sent.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top