Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Presentation: On the use of continued fractions
for stream cipher
Amadou Moctar Kane
KSecurity
amadou1@gmail.com
May 4, 2015
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
1 Introduction
2 Continued Fractions
3 On the use of continued fractions for stream cipher
Continued fraction cipher
Khinchin’s Attack
Applications
4 Questions
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Goals
After Diffie-Hellman: Fermat’s little theorem, Linearization
XL, graph theory. . .
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Goals
After Diffie-Hellman: Fermat’s little theorem, Linearization
XL, graph theory. . .
Continued Fraction
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Goals
After Diffie-Hellman: Fermat’s little theorem, Linearization
XL, graph theory. . .
Continued Fraction
How to use?
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Goals
After Diffie-Hellman: Fermat’s little theorem, Linearization
XL, graph theory. . .
Continued Fraction
How to use?
Quadratic irrational?
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Goals
After Diffie-Hellman: Fermat’s little theorem, Linearization
XL, graph theory. . .
Continued Fraction
How to use?
Quadratic irrational?
Γ?
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued Fractions
An expression of the form
α := a0 +
b0
a1 +
b1
a2 +
b2
...
is called a generalized continued fraction. Typically, the numbers
a1, . . . , b1, . . . may be real or complex, and the expansion may be
finite or infinite.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Preliminaries
It is not possible to find an irrational number α simply on the
basis of knowledge of the partial quotients [am+1, . . . , am+n].
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Preliminaries
It is not possible to find an irrational number α simply on the
basis of knowledge of the partial quotients [am+1, . . . , am+n].
The knowledge of a = [am+1, . . . , am+n] does not allow to
know any other partial quotients of continued fraction
expansion.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Preliminaries
It is not possible to find an irrational number α simply on the
basis of knowledge of the partial quotients [am+1, . . . , am+n].
The knowledge of a = [am+1, . . . , am+n] does not allow to
know any other partial quotients of continued fraction
expansion.
r
log(A) is transcendental.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Stream Ciphers
First Algorithm:Stream Cipher
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Stream Ciphers
One time pad.
random key ⊕ plaintext
Unbreakable system.
Easy to implement.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Stream Ciphers
One time pad.
random key ⊕ plaintext
Unbreakable system.
Easy to implement.
Stream Ciphers.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Continued fraction cipher
We suppose that z ∈R N, and m is the secret message.
Table: Continued fraction cipher.
Alice Bob
computes t ≡ ze mod n
t
=⇒ computes z ≡ td mod n.
Computes X = e
log(z) Computes X = e
log(z)
Computes the CFE of X Computes the CFE of X.
Concatenates some PQ’s Concatenates some PQ’s.
Produces the keystream k1 Produces the keystream k1.
Computes m1 := m ⊕ k1
m1
=⇒ receives m1.
Computes m := m1 ⊕ k1
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Efficiency analysis
Table: Comparison with Blum-Blum-Shub.
Number of bits producted Computing time in seconds
BBS 150000 2.358
Our algorithm 150000 0.007
We worked with an irrational X ∈ Γ, and the number of digits of
the partial numerator (bi ’s) was around 5000. For BBS, n had 949
digits, the results are listed below.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin
Aleksandr Khinchin proved in 1935 that for almost all real numbers
x, the infinitely many partial quotients ai of the continued fraction
expansion of x have an astonishing property: their geometric mean
is a constant, known as Khinchin’s constant, which is independent
of the value of x. That is, for
x = a1 +
1
a2 +
1
...
lim
n→∞
n
i=1
ai
1/n
= K ≈ 2, 6854520010 . . .
where K is Khinchin’s constant.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin’s Attack
The attacker Eve needs the cipher only to find a part of the
message in these following steps:
Eve eavesdrops a long cipher text Tn, splits it in bytes and
computes
K1 = lim
n→∞
n
i=1
di
1/n
.
where di is the integer corresponding to the byte i.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Example of Khinchin’s Attack on π
The first partial quotients of π are :
[3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...]
17
i=1
ai
1/17
≈ 2.6929721 . . .
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Example of Khinchin’s Attack on π
The first partial quotients of π are :
[3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...]
17
i=1
ai
1/17
≈ 2.6929721 . . .
let’s suppose that the plaintext is 11111111111111111.
keystream : 0111 1111 0001 100100100 .....0010 0010
plaintext : 0001 0001 0001 0001 .....0001 0001
cipher : 0110 1110 0000 100100101 ....0011 0011
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Example of Khinchin’s Attack on π
The first partial quotients of π are :
[3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...]
17
i=1
ai
1/17
≈ 2.6929721 . . .
let’s suppose that the plaintext is 11111111111111111.
keystream : 0111 1111 0001 100100100 .....0010 0010
plaintext : 0001 0001 0001 0001 .....0001 0001
cipher : 0110 1110 0000 100100101 ....0011 0011
In base 10, the cipher will be: 6 14 1 293 1 1 1 3 1 2 1 15 3 1
1 3 3.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin’s Attack
Eve computes the geometric mean of the cipher:
(6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17)
= 2.867
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin’s Attack
Eve computes the geometric mean of the cipher:
(6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17)
= 2.867
Eve Makes a conclusion, for example there are a lot of zeros
in the plain text.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin’s Attack
Eve computes the geometric mean of the cipher:
(6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17)
= 2.867
Eve Makes a conclusion, for example there are a lot of zeros
in the plain text.
She modifies the cipher and computes the geometric mean of
the new cipher
K2 = (6 ∗ 14 ∗ 1 ∗ 292 ∗ · · · ∗ 2)(1/17)
= 2.595
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Khinchin’s Attack
Eve computes the geometric mean of the cipher:
(6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17)
= 2.867
Eve Makes a conclusion, for example there are a lot of zeros
in the plain text.
She modifies the cipher and computes the geometric mean of
the new cipher
K2 = (6 ∗ 14 ∗ 1 ∗ 292 ∗ · · · ∗ 2)(1/17)
= 2.595
. . .
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Applications
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Applications
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Conclusion
1 Goal 1: I tried to find new techniques using continued
fraction in cryptography.
2 Goal 2: I was interested in finding new methods of
cryptanalysis.
3 Goal 3: I tried to create a renewal of interest around
continued fractions.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Conclusion
1 Goal 1: I tried to find new techniques using continued
fraction in cryptography.
Result: I designed a new pseudo random generator
statistically tested.
2 Goal 2: I was interested in finding new methods of
cryptanalysis.
3 Goal 3: I tried to create a renewal of interest around
continued fractions.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Conclusion
1 Goal 1: I tried to find new techniques using continued
fraction in cryptography.
Result: I designed a new pseudo random generator
statistically tested.
2 Goal 2: I was interested in finding new methods of
cryptanalysis.
Result: I designed a weak version which can be attacked by
the Khinchin constant.
3 Goal 3: I tried to create a renewal of interest around
continued fractions.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
Continued fraction cipher
Khinchin’s Attack
Applications
Conclusion
1 Goal 1: I tried to find new techniques using continued
fraction in cryptography.
Result: I designed a new pseudo random generator
statistically tested.
2 Goal 2: I was interested in finding new methods of
cryptanalysis.
Result: I designed a weak version which can be attacked by
the Khinchin constant.
3 Goal 3: I tried to create a renewal of interest around
continued fractions.
Result: I introduced the works of Khinchin, Kuzmin, Levy, and
Lochs in cryptology.
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
Outline
Introduction
Continued Fractions
On the use of continued fractions for stream cipher
Questions
For your attention
Thank you!
Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph

More Related Content

PPT
Basics of Coding Theory
PPT
Ch3 datalink
PPT
New error-detection
PDF
Burst Error Correction
PDF
Error Control Coding -Introduction
PPTX
Data link layar
PPT
Hamming codes
PPT
Source coding
Basics of Coding Theory
Ch3 datalink
New error-detection
Burst Error Correction
Error Control Coding -Introduction
Data link layar
Hamming codes
Source coding

What's hot (18)

PDF
Error Correction of Burst error
PPTX
Error control coding
PPTX
Encoder for (7,3) cyclic code using matlab
PPTX
PPT
error control coding
PPT
Ch10
PPT
New error-detection (2)
PDF
Network security CS2
PPTX
Coding Scheme/ Information theory/ Error coding scheme
PPT
Channel Coding (Error Control Coding)
PPT
Error correction, ARQ, FEC
PPTX
Block coding, error detection (Parity checking, Cyclic redundancy checking (C...
PPT
Slides
PPTX
Chapter 10
PPTX
Error control coding techniques
PPT
01 introduction
PPT
The Data Link Layer
PDF
Error Correction of Burst error
Error control coding
Encoder for (7,3) cyclic code using matlab
error control coding
Ch10
New error-detection (2)
Network security CS2
Coding Scheme/ Information theory/ Error coding scheme
Channel Coding (Error Control Coding)
Error correction, ARQ, FEC
Block coding, error detection (Parity checking, Cyclic redundancy checking (C...
Slides
Chapter 10
Error control coding techniques
01 introduction
The Data Link Layer
Ad

Viewers also liked (19)

PPT
Kits de regalo- barderadas
PPTX
Magento portfolio
PDF
Stress distribution in grinding by finite element analysis
PDF
Informe de Estrategia Semanal del del 15 al 21 de septiembre
PDF
Migraciones y derechos humanos. El rol del Comité de Protección de los Derech...
PPTX
Quickbook11
PDF
Results
DOC
Acao cautelar inominada_com_pedido_liminar_i
PDF
Kansallisen Sote-ICT -strategian kansalaisosion toimeenpanosuunnitelma, Kuule...
PPTX
люба конкурс воспит.года2015
PPTX
Noruega
PDF
SEBRAE - Novo ICMS - Saiba como proceder
PDF
Stahl 6600 Fluorescent Light Fitting - ATEX Zone 1 Zone 2 Hazardous Area Ligh...
PDF
mHealth: Revolutionizing Healthcare Worldwide
PDF
Certificaat - Vakbondsconsulent 1e lijn
PDF
Barry Recommendation Letter
PDF
York Home first page
PDF
Arbitration Award - Non-ODL carrier remedy
Kits de regalo- barderadas
Magento portfolio
Stress distribution in grinding by finite element analysis
Informe de Estrategia Semanal del del 15 al 21 de septiembre
Migraciones y derechos humanos. El rol del Comité de Protección de los Derech...
Quickbook11
Results
Acao cautelar inominada_com_pedido_liminar_i
Kansallisen Sote-ICT -strategian kansalaisosion toimeenpanosuunnitelma, Kuule...
люба конкурс воспит.года2015
Noruega
SEBRAE - Novo ICMS - Saiba como proceder
Stahl 6600 Fluorescent Light Fitting - ATEX Zone 1 Zone 2 Hazardous Area Ligh...
mHealth: Revolutionizing Healthcare Worldwide
Certificaat - Vakbondsconsulent 1e lijn
Barry Recommendation Letter
York Home first page
Arbitration Award - Non-ODL carrier remedy
Ad

Similar to On the use of continued fraction for stream ciphers ver1 (20)

PDF
On the use of continued fraction for mutual authentication
PDF
A Numerical Analytic Continuation and Its Application to Fourier Transform
PDF
Recurrent Neural Networks (DLAI D7L1 2017 UPC Deep Learning for Artificial In...
PPTX
Digital Communication Techniques
PDF
Digit Factorial Chains .(Euler Problem -74) (Matlab Programming Solution)
PDF
Dynamic programing
PPT
ch-10-Eliptic-Curve-Cryptosystems_Forouzan.ppt
PDF
keeloq-final
PDF
Basics of Cryptography - Stream ciphers and PRNG
PDF
Design an Analysis of Algorithms I-SECS-1021-03
PDF
エンドツーエンド音声合成に向けたNIIにおけるソフトウェア群 ~ TacotronとWaveNetのチュートリアル (Part 1)~
PPTX
Unit-1.pptx
PPTX
Binu Siva Singh Final.pptx
PDF
Design Encryption for Video Streaming with Brain Storm Optimization
PDF
chapter one && two.pdf
PDF
Temporal network epidemiology: Subtleties and algorithms
PDF
Acm aleppo cpc training second session
PDF
FM 2015 - Narrowing operators on template abstract domains
PDF
Fast coputation of Phi(x) inverse
PDF
Properties and Impact of Vicinity in Mobile Opportunistic Networks
On the use of continued fraction for mutual authentication
A Numerical Analytic Continuation and Its Application to Fourier Transform
Recurrent Neural Networks (DLAI D7L1 2017 UPC Deep Learning for Artificial In...
Digital Communication Techniques
Digit Factorial Chains .(Euler Problem -74) (Matlab Programming Solution)
Dynamic programing
ch-10-Eliptic-Curve-Cryptosystems_Forouzan.ppt
keeloq-final
Basics of Cryptography - Stream ciphers and PRNG
Design an Analysis of Algorithms I-SECS-1021-03
エンドツーエンド音声合成に向けたNIIにおけるソフトウェア群 ~ TacotronとWaveNetのチュートリアル (Part 1)~
Unit-1.pptx
Binu Siva Singh Final.pptx
Design Encryption for Video Streaming with Brain Storm Optimization
chapter one && two.pdf
Temporal network epidemiology: Subtleties and algorithms
Acm aleppo cpc training second session
FM 2015 - Narrowing operators on template abstract domains
Fast coputation of Phi(x) inverse
Properties and Impact of Vicinity in Mobile Opportunistic Networks

On the use of continued fraction for stream ciphers ver1

  • 1. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Presentation: On the use of continued fractions for stream cipher Amadou Moctar Kane KSecurity amadou1@gmail.com May 4, 2015 Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 2. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions 1 Introduction 2 Continued Fractions 3 On the use of continued fractions for stream cipher Continued fraction cipher Khinchin’s Attack Applications 4 Questions Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 3. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Goals After Diffie-Hellman: Fermat’s little theorem, Linearization XL, graph theory. . . Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 4. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Goals After Diffie-Hellman: Fermat’s little theorem, Linearization XL, graph theory. . . Continued Fraction Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 5. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Goals After Diffie-Hellman: Fermat’s little theorem, Linearization XL, graph theory. . . Continued Fraction How to use? Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 6. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Goals After Diffie-Hellman: Fermat’s little theorem, Linearization XL, graph theory. . . Continued Fraction How to use? Quadratic irrational? Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 7. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Goals After Diffie-Hellman: Fermat’s little theorem, Linearization XL, graph theory. . . Continued Fraction How to use? Quadratic irrational? Γ? Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 8. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued Fractions An expression of the form α := a0 + b0 a1 + b1 a2 + b2 ... is called a generalized continued fraction. Typically, the numbers a1, . . . , b1, . . . may be real or complex, and the expansion may be finite or infinite. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 9. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Preliminaries It is not possible to find an irrational number α simply on the basis of knowledge of the partial quotients [am+1, . . . , am+n]. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 10. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Preliminaries It is not possible to find an irrational number α simply on the basis of knowledge of the partial quotients [am+1, . . . , am+n]. The knowledge of a = [am+1, . . . , am+n] does not allow to know any other partial quotients of continued fraction expansion. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 11. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Preliminaries It is not possible to find an irrational number α simply on the basis of knowledge of the partial quotients [am+1, . . . , am+n]. The knowledge of a = [am+1, . . . , am+n] does not allow to know any other partial quotients of continued fraction expansion. r log(A) is transcendental. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 12. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Stream Ciphers First Algorithm:Stream Cipher Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 13. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Stream Ciphers One time pad. random key ⊕ plaintext Unbreakable system. Easy to implement. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 14. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Stream Ciphers One time pad. random key ⊕ plaintext Unbreakable system. Easy to implement. Stream Ciphers. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 15. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Continued fraction cipher We suppose that z ∈R N, and m is the secret message. Table: Continued fraction cipher. Alice Bob computes t ≡ ze mod n t =⇒ computes z ≡ td mod n. Computes X = e log(z) Computes X = e log(z) Computes the CFE of X Computes the CFE of X. Concatenates some PQ’s Concatenates some PQ’s. Produces the keystream k1 Produces the keystream k1. Computes m1 := m ⊕ k1 m1 =⇒ receives m1. Computes m := m1 ⊕ k1 Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 16. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Efficiency analysis Table: Comparison with Blum-Blum-Shub. Number of bits producted Computing time in seconds BBS 150000 2.358 Our algorithm 150000 0.007 We worked with an irrational X ∈ Γ, and the number of digits of the partial numerator (bi ’s) was around 5000. For BBS, n had 949 digits, the results are listed below. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 17. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin Aleksandr Khinchin proved in 1935 that for almost all real numbers x, the infinitely many partial quotients ai of the continued fraction expansion of x have an astonishing property: their geometric mean is a constant, known as Khinchin’s constant, which is independent of the value of x. That is, for x = a1 + 1 a2 + 1 ... lim n→∞ n i=1 ai 1/n = K ≈ 2, 6854520010 . . . where K is Khinchin’s constant. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 18. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin’s Attack The attacker Eve needs the cipher only to find a part of the message in these following steps: Eve eavesdrops a long cipher text Tn, splits it in bytes and computes K1 = lim n→∞ n i=1 di 1/n . where di is the integer corresponding to the byte i. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 19. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Example of Khinchin’s Attack on π The first partial quotients of π are : [3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...] 17 i=1 ai 1/17 ≈ 2.6929721 . . . Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 20. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Example of Khinchin’s Attack on π The first partial quotients of π are : [3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...] 17 i=1 ai 1/17 ≈ 2.6929721 . . . let’s suppose that the plaintext is 11111111111111111. keystream : 0111 1111 0001 100100100 .....0010 0010 plaintext : 0001 0001 0001 0001 .....0001 0001 cipher : 0110 1110 0000 100100101 ....0011 0011 Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 21. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Example of Khinchin’s Attack on π The first partial quotients of π are : [3, 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2...] 17 i=1 ai 1/17 ≈ 2.6929721 . . . let’s suppose that the plaintext is 11111111111111111. keystream : 0111 1111 0001 100100100 .....0010 0010 plaintext : 0001 0001 0001 0001 .....0001 0001 cipher : 0110 1110 0000 100100101 ....0011 0011 In base 10, the cipher will be: 6 14 1 293 1 1 1 3 1 2 1 15 3 1 1 3 3. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 22. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin’s Attack Eve computes the geometric mean of the cipher: (6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17) = 2.867 Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 23. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin’s Attack Eve computes the geometric mean of the cipher: (6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17) = 2.867 Eve Makes a conclusion, for example there are a lot of zeros in the plain text. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 24. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin’s Attack Eve computes the geometric mean of the cipher: (6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17) = 2.867 Eve Makes a conclusion, for example there are a lot of zeros in the plain text. She modifies the cipher and computes the geometric mean of the new cipher K2 = (6 ∗ 14 ∗ 1 ∗ 292 ∗ · · · ∗ 2)(1/17) = 2.595 Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 25. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Khinchin’s Attack Eve computes the geometric mean of the cipher: (6∗14∗1∗293∗1∗1∗1∗3∗1∗2∗1∗15∗3∗1∗1∗3∗3)(1/17) = 2.867 Eve Makes a conclusion, for example there are a lot of zeros in the plain text. She modifies the cipher and computes the geometric mean of the new cipher K2 = (6 ∗ 14 ∗ 1 ∗ 292 ∗ · · · ∗ 2)(1/17) = 2.595 . . . Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 26. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Applications Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 27. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Applications Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 28. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Conclusion 1 Goal 1: I tried to find new techniques using continued fraction in cryptography. 2 Goal 2: I was interested in finding new methods of cryptanalysis. 3 Goal 3: I tried to create a renewal of interest around continued fractions. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 29. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Conclusion 1 Goal 1: I tried to find new techniques using continued fraction in cryptography. Result: I designed a new pseudo random generator statistically tested. 2 Goal 2: I was interested in finding new methods of cryptanalysis. 3 Goal 3: I tried to create a renewal of interest around continued fractions. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 30. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Conclusion 1 Goal 1: I tried to find new techniques using continued fraction in cryptography. Result: I designed a new pseudo random generator statistically tested. 2 Goal 2: I was interested in finding new methods of cryptanalysis. Result: I designed a weak version which can be attacked by the Khinchin constant. 3 Goal 3: I tried to create a renewal of interest around continued fractions. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 31. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions Continued fraction cipher Khinchin’s Attack Applications Conclusion 1 Goal 1: I tried to find new techniques using continued fraction in cryptography. Result: I designed a new pseudo random generator statistically tested. 2 Goal 2: I was interested in finding new methods of cryptanalysis. Result: I designed a weak version which can be attacked by the Khinchin constant. 3 Goal 3: I tried to create a renewal of interest around continued fractions. Result: I introduced the works of Khinchin, Kuzmin, Levy, and Lochs in cryptology. Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph
  • 32. Outline Introduction Continued Fractions On the use of continued fractions for stream cipher Questions For your attention Thank you! Amadou Moctar Kane Presentation: On the use of continued fractions for stream ciph