1 / 24

ECE 448 – FPGA and ASIC Design with VHDL

ECE 448: Lab 2 Implementing Sequential Logic in VHDL. ECE 448 – FPGA and ASIC Design with VHDL. George Mason University. Agenda for today. Part 1: Introduction to Experiment 2: Stream Cipher Trivium Part 2: Example: Programmable LFSR-based Pseudorandom Number Generator

mjoyce
Download Presentation

ECE 448 – FPGA and ASIC Design with VHDL

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ECE 448: Lab 2 Implementing Sequential Logic in VHDL ECE 448 – FPGA and ASIC Design with VHDL George Mason University

  2. Agenda for today Part 1: Introduction to Experiment 2: Stream Cipher Trivium Part 2: Example: Programmable LFSR-based Pseudorandom Number Generator Part 3: Hands-on Session: Simulation using ModelSim

  3. Part 1 Introduction to Experiment 2 Stream Cipher Trivium

  4. Secret-Key Ciphers key of Alice and Bob - KAB key of Alice and Bob - KAB Network Decryption Encryption Bob Alice

  5. Cipher Message / Ciphertext m bits Cryptographic Key Encrypt/Decrypt k bits 1 bit m bits Ciphertext / Message

  6. Block vs. stream ciphers M1, M2, …, Mn m1, m2, …, mn memory Block cipher K K Stream cipher C1, C2, …, Cn c1, c2, …, cn Ci=fK(Mi) ci = fK(mi, mi-1, …, m2, m1) Every block of ciphertext is a function of only one corresponding blockof plaintext Every block of ciphertext is a function of the current and all proceeding blocks of plaintext

  7. Typical stream cipher Sender Receiver Initialization Vector - IV Initialization Vector - IV Key - K Key - K Pseudorandom Key Generator Pseudorandom Key Generator keystream ki keystream ki mi ci ci mi plaintext ciphertext ciphertext plaintext

  8. Example ci = mi ki message mi ki ci 01110110101001010110101 11011101110110101110110 10101011011111111000011 keystream ciphertext mi = ci ki ci ki mi ciphertext 10101011011111111000011 11011101110110101110110 01110110101001010110101 keystream message

  9. Common Building Blocks of Pseudorandom Key Generators • Linear Feedback Shift Register (LFSR) • Non-linear Feedback Shift Register (NFSR)

  10. LFSR = Linear Feedback Shift Register Example of a simple 5-stage LFSR si si+1 si+2 si+3 si+4 si+5 si+5 = si + si+1 + si+3 Notation: + is used to denote XOR 1 register stage = D flip-flop

  11. NFSR = Non-Linear Feedback Shift Register Example of a simple 5-stage NFSR bi bi+1 bi+2 bi+3 bi+4 bi+5 bi+5 = bibi+1 + bi+3 + is used to denote XOR bmbn is used to denote bm AND bn

  12. eSTREAM - Contest for a new stream cipher standard, 2004-2008 PROFILE 1 • Stream cipher suitable for software implementations optimized for high speed • Minimum key size - 128 bits • Initialization vector – 64 bits or 128 bits PROFILE 2 • Stream cipher suitable for hardware implementations with limited memory, number of gates, or power supply • Minimum key size - 80 bits • Initialization vector – 32 bits or 64 bits

  13. Trivium Stream Cipher • One of the 3 winners of the contest • 80 Bit Key and IV • Hardware Oriented • Very simple (“trivial”) internal structure • Parallelizable up to 64 bits/clock cycle

  14. s69 s286s287 Shift Register u3 t3 AND t1 t2 u1 s91s92 u2 s264 s171 s175s176 XOR Trivium – Internal Structure

  15. Pseudocode of the Keystream Generation for i = 1 to N do t1 ← s66 + s93 t2 ← s162 + s177 t3 ← s243 + s288 zi ← t1 + t2 + t3 u1 ← t1 + s91 · s92 + s171 u2 ← t2 + s175 · s176 + s264 u3 ← t3 + s286 · s287 + s69 (s1, s2, ... , s93) ← (u3, s1, ... , s92) (s94, s95, ... , s177) ← (u1, s94 , ... , s176) (s178, s279 , ... , s288) ← (u2, s178 , ... , s287) end for

  16. Initialization • Key is placed in registers s1-s80 • IV is placed in registers s94-174 • Remaining bits are 0 except for 286-288 which are 1 • Run for 4 complete cycles discarding keystream

  17. Pseudocode of the Initialization

  18. Requested Interface & Control Unit

  19. Extra Credit Parallelized Architecture of Trivium

  20. Parallelization of Trivium • Goal: • Encrypt two (or more) bits of a message per clock cycle • Requires generating two (or more) bits of the corresponding keystream per clock cycle • Approach: • Duplicate logic in feedback loops (XOR and AND gates) • Shift by two (or more) positions per clock cycle

  21. Pseudocode of the Keystream Generation in a parallelized version of Trivium A 2-bit output per clock cycle for i = 1 to N/2 do t1 <- s66 + s93 t2 <- s162 + s177 t3 <- s243 + s288 t1_1 <- s65 + s92 t2_1 <- s161 + s176 t3_1 <- s242 + s287 zi <- (t1 + t2 + t3) || (t1_1 + t2_1 + t3_1) u1 <- t1 + s91 + s92 + s171 u2 <- t1 + s175 + s176 + s264 u3 <- t1 + s286 + s287 + s69 u1_1 <- t1_1 + s90 + s91 + s170 u2_1 <- t2_1 + s174 + s175 + s263 u3_1 <- t3_1 + s285 + s286 + s68 (s1,s2,...,s93) <- (u3_1,u3,s1,...,s91) (s94,s95,...,s177) <- (u1_1,u1,s94,...,s175) (s178,s279,...,s288) <- (u2_1,u2,s178,...,s286) end for

  22. Part 2 Example: Programmable LFSR-based Pseudorandom Number Generator

  23. LFSR with the Programmable Feedback Logic cL-1 cL-2 c1 c0 sin Current_state See source codes available on the lab web page

  24. Part 3 Hands-on Session on Simulation using ModelSim

More Related