Blockcipher-based Authentcated Encryption: How Small Can We Go? - - PowerPoint PPT Presentation

blockcipher based authentcated encryption how small can
SMART_READER_LITE
LIVE PREVIEW

Blockcipher-based Authentcated Encryption: How Small Can We Go? - - PowerPoint PPT Presentation

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Blockcipher-based Authentcated Encryption: How Small Can We Go? Avik Chakraborti (Indian Statistical


slide-1
SLIDE 1

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

Blockcipher-based Authentcated Encryption: How Small Can We Go?

Avik Chakraborti (Indian Statistical Institute, Kolkata) Tetsu Iwata (Nagoya University, Japan) Kazuhiko Minematsu (NEC Corporation, Japan) Mridul Nandi (Indian Statistical Institute, Kolkata)

September, 2016

COFB

slide-2
SLIDE 2

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-3
SLIDE 3

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

Authenticated Encryption (AE)

More Formally.... AE.enc : M×D×N ×K → C AE.dec : C × D × N × K → M∪ ⊥

Goal Primitive Security Privacy Symmetric Encryption IND-CPA Integrity MAC/Others INT-CTXT

Table: Security Properties

COFB

slide-4
SLIDE 4

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

IND-CPA Security for Privacy

Ek(.) $(.) A Simulate Ek(.) Simulate $(.) (Ni, Ai, Mi) i = 1 . . . q i = 1 . . . q 0/1 (Ni, Ai, Mi) (Ci, Ti) (Ci, Ti)

∆A(O1; O2) = | Pr[AO1 = 1] − Pr[AO2 = 1]|. AdvPRIV

AE

(A) := ∆A(EK; $) AdvPRIV

AE

(q, σ, t) = maxA AdvPRIV

AE

(A) t: Time, q: #queries , σ: # blocks in all queries

COFB

slide-5
SLIDE 5

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

INT-CTXT Security for Integrity

Ek(·) Vk(·) A (Ni, Ai, Mi) (Ci, Ti) (N∗

j , A∗ j , C ∗ j , T ∗ j )

0/1 i = 1 . . . qe j = 1 . . . qf forge attempts

A forges if ∃ (N∗

j , A∗ j , C ∗ j , T ∗ j ) ∋ Vk(N∗ j , A∗ j , C ∗ j , T ∗ j ) = 1

AdvINT

AE (A) := Pr[AEk forges]

AdvINT

AE ((qe, qf ), (σe, σf ), t) = maxA AdvINT AE (A)

COFB

slide-6
SLIDE 6

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-7
SLIDE 7

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

Current State of the Art

Structural Properties

Schemes CLOC-SILC AES-JAMBU iFEED State 2n + k 1.5n + k 3n + k Rate

1 2 1 2

1 Proofs Yes Yes (integrity only) Yes (wrong)

Here n is the blocksize of blockcipher

COFB

slide-8
SLIDE 8

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

Main Idea and Motivation Behind the Construction

Very small cipher state Provably Security in terms of both Privacy and Integrity

COFB

slide-9
SLIDE 9

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-10
SLIDE 10

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

iCOFB Construction

Generic Combined Feedback Mode Instantiated by COFB AE scheme Easy to Understand COFB

COFB

slide-11
SLIDE 11

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

iCOFB Construction

RN,A,(0,0) RN,A,(1,0) RN,A,(2,0) RN,A,(3,0) RN,A,(4,1) 0n Y [0] Y [1] Y [2] Y [3] Y [4] X[1] X[2] X[3] X[4] M[1] M[2] M[3] M[4] C[1] C[2] C[3] C[4] ρ ρ ρ ρ

Powered by TCPDF (www.tcpdf.org)

RN,A,(a,b): Tweakable random function ∀N, A, (a, b), RN,A,(a,b) : B → B

COFB

slide-12
SLIDE 12

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

iCOFB Construction

RN,A,(0,0) RN,A,(1,0) RN,A,(2,0) RN,A,(3,0) RN,A,(4,1) 0n Y [0] Y [1] Y [2] Y [3] Y [4] X[1] X[2] X[3] X[4] M[1] M[2] M[3] M[4] C[1] C[2] C[3] C[4] ρ ρ ρ ρ

Powered by TCPDF (www.tcpdf.org)

ρ : Linear Feedback Function

COFB

slide-13
SLIDE 13

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

iCOFB Construction

RN,A,(0,0) RN,A,(1,0) RN,A,(2,0) RN,A,(3,0) RN,A,(4,1) 0n Y [0] Y [1] Y [2] Y [3] Y [4] X[1] X[2] X[3] X[4] M[1] M[2] M[3] M[4] C[1] C[2] C[3] C[4] ρ ρ ρ ρ

Powered by TCPDF (www.tcpdf.org)

CT = (C[1], C[2], C[3], C[4]), Tag = Y [4]

COFB

slide-14
SLIDE 14

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

Linear Feedback Function : ρ

For ρ : B × B → B × B, ∃ρ

Correctness Condition for encryption,

∀Y , M ∈ B, ρ(Y , M) = (X, C) ⇒ ρ

′(Y , C) = (X, M)

ρ ensures given (Y , C): M should be uniquely computable Example : ρ = G I I I

  • , ρ

′ =

I + G I I I

  • , G is invertible

COFB

slide-15
SLIDE 15

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

ρ and ρ

ρ: During Encryption X[i] C[i]

  • =

E1,1 E1,2 E2,1 E2,2 Y [i − 1] M[i]

  • If ρ Satisfies the correctness condition then E2,2 must be inv

ρ

′: During Decryption

X[i] M[i]

  • =

D1,1 D1,2 D2,1 D2,2 Y [i − 1] C[i]

  • D1,1 = E1,1 + E1,2.E −1

2,2 .E2,1, D1,2 = E1,2

D2,1 = E −1

2,2 .E2,1, D2,2 = E −1 2,2

ρ is Valid if both (C1) E2,1, (C2) D1,2 and (C3) D1,1 invertible

COFB

slide-16
SLIDE 16

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-17
SLIDE 17

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Motivation Idealized Combined-Feedback Authenticated Encryption : iCOFB Security of iCOFB

Privacy and Authencity for iCOFB

(C2) ⇒ ∀Y , C = C ′, D1,1.Y + D1,2.C = D1,1.Y + D1,2.C ′ (C3) ⇒ ρ is invertible (for correctness E −1

2,2 is invertible).

Hence, Pr[Y

$

← B : D1,1.Y + D1,2.C = X] = 2−n, ∀(C, X) ∈ B2 Theorem If ρ is valid then for adversary A making q encryption queries and qf forging attempts having at most ℓf many blocks, we have Advpriv

iCOFB(A) = 0,

Advauth

iCOFB(A) ≤ qf (ℓf + 1)

2n .

COFB

slide-18
SLIDE 18

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB Underlying Mathematical Components for COFB Security Bounds Properties

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-19
SLIDE 19

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

Design Rationale and Challenges

COFB : An instantiation of iCOFB Instatiation of iCOFB is possible by standard method (like XE mode) But results in 2 state memories Here, we considered half tweak (only Half-bit mask) Sufficient for standard security bound The proof for COFB is not the same as XE based iCOFB Proof based on specific design (w/o iCOFBs security bound)

COFB

slide-20
SLIDE 20

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

COFB (Combined Feedback) Mode

X[i] M[i] C[i] ρ R X[i] M[i] C[i] R X[i] M[i] C[i] R X[i] M[i] C[i] R X[i − 1] X[i − 1] X[i − 1] X[i − 1] G

COFB

slide-21
SLIDE 21

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

COFB Authenticated Encryption Scheme

Y [4] Y [5] Y [6] EK EK EK X[4] X[6] X[5] M[2] M[3] mask∆(3, δA) mask∆(4, δA) mask∆(4, δA + δM) C[2] C[3] T ρ ρ1 M[1] Y [3] C[1] ρ ρ A[1] A[2] A[3] EK 0n/2 N Y [0] Y [1] Y [2] Y [3] ρ1 mask∆(1, 0) mask∆(2, 0) mask∆(2, δA) EK EK EK X[1] X[3] X[2] ρ1 ρ1 Z[1] Z[2] Z[3] X [1] X [2] X [3] COFB

slide-22
SLIDE 22

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

COFB Authenticated Encryption Mode

Underlying Blockcipher We use AES-128 as the underlying blockcipher n = 128 mask Function mask - mask is simple tweak update function ρ1 and ρ Functions ρ1 and ρ Functions - Simple Linear Feedback Functions. Last Block has different tweak

COFB

slide-23
SLIDE 23

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

Tweak Function

Tweak - Nonce dependent 64 -bit secret value. Standard Tweak size - 128-bits. Here 64-bit is sufficient Computed/ updated by mask∆(a, b) = αa(1 + α)b.∆ (a, b) ∈ [0..L] × [0..4], L be the message length in blocks α - primitive element in F264

COFB

slide-24
SLIDE 24

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

Linear Feedback Function

Two feedback function - ρ1 and ρ ρ1(y, M) := G · y ⊕ M and ρ(y, M) = (ρ1(y, M), y ⊕ M) G : (y1, y2, y3, y4) → (y2, y3, y4, y4 ⊕ y1) Gn×n =     I I I I I    

COFB

slide-25
SLIDE 25

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB Underlying Mathematical Components for COFB Security Bounds Properties

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-26
SLIDE 26

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

Security Level for COFB

Security Bounds for privacy Birthday Bound 64-bit for Privacy Security Bounds for Authenticity Birthday Bound 64-bit for Authenticity

COFB

slide-27
SLIDE 27

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB Underlying Mathematical Components for COFB Security Bounds Properties

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-28
SLIDE 28

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion Underlying Mathematical Components for COFB Security Bounds Properties

Important Features of COFB

Advantages It is a “Rate − 1” construction. Very low state size. Only 1.5n + k (n:blockcipher size) Very Flexible Mode (Any Blockcipher) It is inverse-free Simple yet highly effective Linear Feedback Very Lightweight and Consumes Low Hardware area Limitations Both the encryption and decryption are completely serial

COFB

slide-29
SLIDE 29

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-30
SLIDE 30

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

COFB-Base Architecture

064||N State 128 128 128 128 128 128 128 128 AESr Key ρ ∆ tweak 128 T chop 128 64 AD/M 64 ||064 ⊕ ⊕ ⊕ C 128 128 64

COFB

slide-31
SLIDE 31

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

COFB-Base Architecture Properties

No pipelined register Serial processing of data Processes 128-bits per 12 clock cycles Uses Very Low Storage Registers Minimum Hardware Area Among All the Known Implementations

COFB

slide-32
SLIDE 32

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

COFB FPGA Implementation

Informations VHDL PLatform - Virtex 6 Under Xilinx 13.4 Target Device - xc6vlx760 Base Implementation Results Area : 722 Slice Reg, 1075 LUTs and 442 Slices Frequency : 267.20 MHZ, Throughput : 2.85 Gbps

COFB

slide-33
SLIDE 33

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

Benchmarking of COFB

A fair comparison is needed A fair comparison based on GMU inteface to be done in future

COFB

slide-34
SLIDE 34

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

1

Introduction

2

Idealized Combined Feedback Construction : iCOFB

3

Specification for COFB

4

Hardware Implimentation Results of COFB

5

Conclusion

COFB

slide-35
SLIDE 35

Introduction Idealized Combined Feedback Construction : iCOFB Specification for COFB Hardware Implimentation Results of COFB Conclusion

Conclusion

COFB : Blockcipher based AE 64-bit privacy and 64-bit authenticity. Low Area AE and can be used in low resource embedded device

Thank you

COFB