Some Problems in Cryptology: Bimal K. Roy

Some Problems in Cryptology
Bimal K. Roy
Indian Statistical Institute

203 Barrackpore Trunk Road
Kolkata 700 108, India
Cryptology – the art of secrecy
Encryption: Ek1 (M) = C Decryption: Dk2 (C ) = M
1. If k1 and k2 are known, all computations must be easy.

2. If k1 and k2 are unknown, then even if E , D, C are known,
obtaining any information about M should be difficult!
Secrecy without a key
400 BC, Greece

I Shave head of Spy
I Tattoo on Head
I Grow hair and travel
Secrecy with a key – Early days
Sherlock Holmes: The Adventure of the Dancing Men
Substitution Cipher: Key is a code book for substituting letters

in the plaintext alphabet with unique characters.
Is this a secure scheme?

Statistical attack on Substitution Cipher
Statistical frequency analysis on a large volume of ciphertext

reveals the plaintext if the alphabet has characteristic patterns.
English
E = 12.7%
T = 9.1%
A = 8.2%
O = 7.5%
I = 7.0%
N = 6.7%
Secrecy with a key – Modern times
RC4: Rivest, 1987
Enc: C = P ⊕ K
Dec: P = C ⊕ K
Basic goal is to obtain a random stream of bytes K , by

1. creating a random permutation S of {0, . . . , 255},
2. and extracting random bytes from S thereafter
Does this really give a random stream of bytes?

Statistical attack on RC4
For a random stream of bytes (decimals 0 to 255), you expect the

second output byte to be equal to 0 with probability 1/256.
However, Mantin and Shamir proved: P(z2 = 0) ≈ 2/256
Broadcast attack: Suppose the same message M is sent to a lot

of receivers, using RC4 with different keys each time. Thus,
Ci = M ⊕ Ki = [m1 , m2 , m3 , . . .] ⊕ [z1i , z2i , z3i , . . .].
Second bytes of Ci are [m2 ⊕ z2i ], where P(z2i = 0) ≈ 2/256
This reveals the message byte m2 for enough ciphertexts!

Main tools for Cryptanalysis
Statistics
I Frequency analysis in case of Substitution Cipher

I Analysis of statistical bias in case of RC4
Combinatorics
I Combinatorial approach to find suitable paths in proving

statistical biases in RC4, and other stream ciphers.
How do we safeguard our systems?
Strong systems
I Provable security: Build strong modes of operations and
protocols using strong primitives which are based on
reasonable and sound security assumptions.
Strong primitives
I Stream Ciphers: Pseudo-random bit generator (PRBG)
I Block Ciphers: Pseudo-random permutation (PRP)
The security notion is to make the randomness of the stream and

block ciphers indistinguishable from that of an unbiased coin
tossed independently over arbitrarily many instances.
Visual Cryptography
Conceptualised by Naor and Shamir, in 1994

I Secret sharing scheme with n participants, 1 secret image
I Secret image to be split into n shadow images called shares
I Certain qualified subsets of participants can recover the secret
I Other forbidden sets of participants have no information
Problem Statement
Construct a (m, n) Visual Cryptography Scheme (VCS) such that

I There are n participants and 1 secret image
I Secret image to be split into n shadow images called shares
I Any m-subset of participants can recover the secret
I No t-subset of participants can recover the image if t < m
In particular, we will construct a (2, n)-VCS in this talk.
Metric: Relative Contrast

If (2, n)-VCS has basis matrices S 0 , S 1 and pixel
expansion m, then relative contrast for participants in
subset X is given by αX (m) = m1 (w (SX1 ) − w (SX0 )).
PBIBD applied to VCS
Visual outcome of (6, 4, 2, 3, 0, 1)-PBIBD to (2, 6)-VCS
Secret image:
One Share Two Shares
Share 1: Shares 1 & 6:
Share 2: Shares 1 & 2:
Relative contrast is
Share 6: 1 1
2 for 1 & 6 and 4 for 1 & 2
VCS for Access Control
Secret is revealed only by the approved sets.

Example : {Boss + Customer} or {Both Managers + Customer}
Data Obfuscation
I Owner of a large database lends it for public use. The user is

allowed to run restricted set of queries on data items.
I Owner’s goal is to prevent the user from deriving any further
information from the database, than what is derivable from
the allowed set of restricted queries.
Data Obfuscation is a type of data masking where some useful

information about the complete dataset remains even after hiding
the individual sensitive information.
Data Obfuscation
The problem:
I User requires the original database to test applications.
I Owner requires privacy of certain columns (attributes).
Potential solution:
I Encrypt data of the private columns. It requires a short (128
bit, say) random key which remains secret with the owner.
Problem with traditional encryption modes is that they are not

format preserving. For example, AADHAAR number 4580 5000
8000 encrypts to **** under 256-bit AES ECB mode. Thus, if the
user application accessing the AADHAAR field has check and
validation for 12-digit AADHAAR number, it simply fails.
Data Obfuscation
Format Preserving Encryption

I Mode of encryption where format of ciphertext is same as
that of the plaintext. That is, the encryption behaves as a
permutation on the domain of the plaintext.
I Example : 12-digit AADHAAR number maps to 12-digit
AADHAAR number, or 16-digit credit card number maps to
16-digit credit card number.
Objectives of Data Obfuscation

I Minimize risk of disclosure while providing access to the data.
I Maximize the analytical usefulness of the accessible data.
To understand cryptographic systems better, one needs to
understand that operational platform of the algorithms
Here is where Engineering comes into the picture.

ColdBoot attack on RSA
Data remanence is a huge problem in cryptographic applications.

Example : Think of a Computer Memory that erases, but slowly.
Any form of residual cryptographic data may be sensitive!

ColdBoot attack on RSA
Idea of the attack

I RSA cryptosystem uses modulus N = pq where the security
depends on the hardness of factoring N.
I PKCS#1 standard for RSA mandates the storage of p, q and
other RSA secret keys in the memory during operation.
I A clever attacker can retrieve partial information about the
RSA secret keys from a decaying computer memory.
If you get about 30% bits of the primes p, q, you can factorize N.
Thank You

Some Problems in Cryptology: Bimal K. Roy

Uploaded by

Some Problems in Cryptology: Bimal K. Roy

Uploaded by

Some Problems in Cryptology

Indian Statistical Institute

Encryption: Ek1 (M) = C Decryption: Dk2 (C ) = M

1. If k1 and k2 are known, all computations must be easy.

400 BC, Greece

Sherlock Holmes: The Adventure of the Dancing Men

Substitution Cipher: Key is a code book for substituting letters

Is this a secure scheme?

Statistical frequency analysis on a large volume of ciphertext

RC4: Rivest, 1987

Basic goal is to obtain a random stream of bytes K , by

Does this really give a random stream of bytes?

For a random stream of bytes (decimals 0 to 255), you expect the

However, Mantin and Shamir proved: P(z2 = 0) ≈ 2/256

Broadcast attack: Suppose the same message M is sent to a lot

Ci = M ⊕ Ki = [m1 , m2 , m3 , . . .] ⊕ [z1i , z2i , z3i , . . .].

Second bytes of Ci are [m2 ⊕ z2i ], where P(z2i = 0) ≈ 2/256

This reveals the message byte m2 for enough ciphertexts!

I Frequency analysis in case of Substitution Cipher

I Combinatorial approach to find suitable paths in proving

The security notion is to make the randomness of the stream and

Conceptualised by Naor and Shamir, in 1994

Construct a (m, n) Visual Cryptography Scheme (VCS) such that

In particular, we will construct a (2, n)-VCS in this talk.

Metric: Relative Contrast

One Share Two Shares

Share 1: Shares 1 & 6:

Share 2: Shares 1 & 2:

Secret is revealed only by the approved sets.

I Owner of a large database lends it for public use. The user is

Data Obfuscation is a type of data masking where some useful

Problem with traditional encryption modes is that they are not

Format Preserving Encryption

Objectives of Data Obfuscation

Here is where Engineering comes into the picture.

Data remanence is a huge problem in cryptographic applications.

Any form of residual cryptographic data may be sensitive!

Idea of the attack

You might also like