OurBigBook
About
$
Donate
Sign in
Sign up
Malleability of an additive one-time pad
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Algebra
Coding theory
One-time pad
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If an interceptor knows that an additive
one-time-pad
ciphertext
C
encrypts
plaintext
P
and wants it to decrypt
as
P
′
, replacing it by
C
′
=
C
−
P
+
P
′
(1)
works
without knowing the key, since
C
′
=
P
′
+
K
.
Ancestors
(6)
One-time pad
Coding theory
Algebra
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ii
/
Paper 2
/
12I
/
b
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version