New AES software speed records
|
|
|
- Margery Watson
- 8 years ago
- Views:
Transcription
1 New AES software speed records Daniel J. Bernstein and Peter Schwabe Indocrypt 2008
2 The estream project ECRYPT Stream Cipher Project Running from 2004 to 2008 to identify promising new stream ciphers Established an open benchmarking suite for stream ciphers For comparison contains 128-bit AES in counter mode Reference implementation by Gladman Other authors added faster implementations This talk describes our new implementation New AES software speed records 2
3 One round of AES in C Input and Output Input: 16-byte state given in 4 32-bit integers y0, y1, y2, y3 Output: 16-byte state given in 4 32-bit integers z0, z1, z2, z3 Tables and keys uint32 rk[44], T0[256], T1[256], T2[256], T3[256]; The rst round of AES z0 = T0[ y0 >> 24 ] ^ T1[(y1 >> 16) & 0xff] \ ^ T2[(y2 >> 8) & 0xff] ^ T3[ y3 & 0xff] ^ rk[4]; z1 = T0[ y1 >> 24 ] ^ T1[(y2 >> 16) & 0xff] \ ^ T2[(y3 >> 8) & 0xff] ^ T3[ y0 & 0xff] ^ rk[5]; z2 = T0[ y2 >> 24 ] ^ T1[(y3 >> 16) & 0xff] \ ^ T2[(y0 >> 8) & 0xff] ^ T3[ y1 & 0xff] ^ rk[6]; z3 = T0[ y3 >> 24 ] ^ T1[(y0 >> 16) & 0xff] \ ^ T2[(y1 >> 8) & 0xff] ^ T3[ y2 & 0xff] ^ rk[7]; New AES software speed records 3
![& 0xff] ^ rk[4]; z1 = T0[ y1 >> 24 ] ^ T1[(y2 >> 16) & 0xff] \ ^ T2[(y3 >> 8) & 0xff] ^ T3[ y0 & 0xff] ^ rk[5]; z2 = T0[ y2 >> 24 ] ^ T1[(y3 >> 16) & 0xff] \ ^ T2[(y0](/docs-images/43/8647978/images/page_3.jpg ">> 8) & 0xff] ^ T3[ y1 & 0xff] ^ rk[6]; z3 = T0[ y3 >> 24 ] ^ T1[(y0 >> 16) & 0xff] \ ^ T2[(y1 >> 8) & 0xff] ^ T3[ y2 & 0xff] ^ rk[7]; New AES software speed records")
4 What a machine is really doing Tables and keys unsigned char rk[176], T0[1024], T1[1024], T2[1024], T3[1024]; The rst round of AES z0 = *(uint32 *)(rk + 16); z1 = *(uint32 *)(rk + 20); z2 = *(uint32 *)(rk + 24); z3 = *(uint32 *)(rk + 28); z0 ^= *(uint32 *) (T0 + ((y0 >> 22) & 0x3fc)) ^ *(uint32 *) (T1 + ((y1 >> 14) & 0x3fc)) \ ^ *(uint32 *) (T2 + ((y2 >> 6) & 0x3fc)) ^ *(uint32 *) (T3 + ((y3 << 2) & 0x3fc)); z1 ^= *(uint32 *) (T0 + ((y1 >> 22) & 0x3fc)) ^ *(uint32 *) (T1 + ((y2 >> 14) & 0x3fc)) \ ^ *(uint32 *) (T2 + ((y3 >> 6) & 0x3fc)) ^ *(uint32 *) (T3 + ((y0 << 2) & 0x3fc)); z2 ^= *(uint32 *) (T0 + ((y2 >> 22) & 0x3fc)) ^ *(uint32 *) (T1 + ((y3 >> 14) & 0x3fc)) \ ^ *(uint32 *) (T2 + ((y0 >> 6) & 0x3fc)) ^ *(uint32 *) (T3 + ((y1 << 2) & 0x3fc)); z3 ^= *(uint32 *) (T0 + ((y3 >> 22) & 0x3fc)) ^ *(uint32 *) (T1 + ((y0 >> 14) & 0x3fc)) \ ^ *(uint32 *) (T2 + ((y1 >> 6) & 0x3fc)) ^ *(uint32 *) (T3 + ((y2 << 2) & 0x3fc)); New AES software speed records 4
5 Interleaving tables Tables and keys unsigned char rk[176], tables[4096]; #define T0 (&tables[0]) #define T1 (&tables[4]) #define T2 (&tables[2048]) #define T3 (&tables[2052]) The rst round of AES z0 = *(uint32 *)(rk + 16); z1 = *(uint32 *)(rk + 20); z2 = *(uint32 *)(rk + 24); z3 = *(uint32 *)(rk + 28); z0 ^= *(uint32 *) (T0 + ((y0 >> 21) & 0x7f8)) ^ *(uint32 *) (T1 + ((y1 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y2 >> 5) & 0x7f8)) ^ *(uint32 *) (T3 + ((y3 << 3) & 0x7f8)); z1 ^= *(uint32 *) (T0 + ((y1 >> 21) & 0x7f8)) ^ *(uint32 *) (T1 + ((y2 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y3 >> 5) & 0x7f8)) ^ *(uint32 *) (T3 + ((y0 << 3) & 0x7f8)); z2 ^= *(uint32 *) (T0 + ((y2 >> 21) & 0x7f8)) ^ *(uint32 *) (T1 + ((y3 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y0 >> 5) & 0x7f8)) ^ *(uint32 *) (T3 + ((y1 << 3) & 0x7f8)); z3 ^= *(uint32 *) (T0 + ((y3 >> 21) & 0x7f8)) ^ *(uint32 *) (T1 + ((y0 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y1 >> 5) & 0x7f8)) ^ *(uint32 *) (T3 + ((y2 << 3) & 0x7f8)); New AES software speed records 5
6 z0 = *(uint32 *)(rk + 16); z1 = *(uint32 *)(rk + 20); z2 = *(uint32 *)(rk + 24); z3 = *(uint32 *)(rk + 28); z0 ^= *(uint32 *) (T0 + ((y0 >> 21) & 0x7f8)) \ ^ *(uint32 *) (T1 + ((y1 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y2 >> 5) & 0x7f8)) \ ^ *(uint32 *) (T3 + ((y3 << 3) & 0x7f8)); z1 ^= *(uint32 *) (T0 + ((y1 >> 21) & 0x7f8)) \ ^ *(uint32 *) (T1 + ((y2 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y3 >> 5) & 0x7f8)) \ ^ *(uint32 *) (T3 + ((y0 << 3) & 0x7f8)); z2 ^= *(uint32 *) (T0 + ((y2 >> 21) & 0x7f8)) \ ^ *(uint32 *) (T1 + ((y3 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y0 >> 5) & 0x7f8)) \ ^ *(uint32 *) (T3 + ((y1 << 3) & 0x7f8)); z3 ^= *(uint32 *) (T0 + ((y3 >> 21) & 0x7f8)) \ ^ *(uint32 *) (T1 + ((y0 >> 13) & 0x7f8)) \ ^ *(uint32 *) (T2 + ((y1 >> 5) & 0x7f8)) \ ^ *(uint32 *) (T3 + ((y2 << 3) & 0x7f8)); New AES software speed records 6
7 Baseline for all architectures Each round has 20 loads, 16 shifts, 16 masks and 16 xors New AES software speed records 7
8 Baseline for all architectures Each round has 20 loads, 16 shifts, 16 masks and 16 xors Last round is slightly dierent: Needs 16 more mask instructions Four load instructions to load input, four xors with key stream, four stores for output... some more overhead Results in 720 instructions needed to encrypt a block of 16 bytes Specically: 208 loads, 4 stores, 508 integer instructions New AES software speed records 7
9 Baseline for all architectures Each round has 20 loads, 16 shifts, 16 masks and 16 xors Last round is slightly dierent: Needs 16 more mask instructions Four load instructions to load input, four xors with key stream, four stores for output... some more overhead Results in 720 instructions needed to encrypt a block of 16 bytes Specically: 208 loads, 4 stores, 508 integer instructions Two strategies to make these instructions execute fast: Reduce the number of instructions Make the machine execute the instructions as fast as possible New AES software speed records 7
10 UltraSPARC (Not the most common architecture but an easy-to-understand example) New AES software speed records 8
11 UltraSPARC (Not the most common architecture but an easy-to-understand example) 64-bit architecture In-order execution Up to 4 instructions per cycle At most 2 integer instructions per cycle At most 1 load/store instruction per cycle Instructions have latencies 24 integer registers available New AES software speed records 8
12 Fast AES on the UltraSPARC Reminder: 208 loads, 4 stores, 508 integer instructions Only one load or store per cycle ( at least 212 cycles) Only 2 integer instructions per cycle ( at least 254 cycles) Make sure to have 2 integer instructions each cycle Make sure to not have extra cycles for load/store instructions Result: 254 cycles/block cycles/byte in the estream benchmarking framework for encryption of 4096 bytes New AES software speed records 9
13 Padded registers (saving 80 instructions) Idea: The UltraSPARC is a 64-bit architecture, pad 32-bit values with zeros, i.e. 0xc66363a5 becomes 0x0c a50 Do that consistently for values in registers, the tables and the round keys, then: Without padded registers p00 = (uint32) y0 >> 21 p01 = (uint32) y0 >> 13 p02 = (uint32) y0 >> 5 p03 = (uint32) y0 << 3 p00 &= 0x7f8 p01 &= 0x7f8 p02 &= 0x7f8 p03 &= 0x7f8 With padded registers p00 = (uint64) y0 >> 48 p01 = (uint64) y0 >> 32 p02 = (uint64) y0 >> 16 p01 &= 0xff0 p02 &= 0xff0 p03 = y0 & 0xff0 New AES software speed records 10
14 Padded registers (saving 120 instructions) Idea: The UltraSPARC is a 64-bit architecture, pad 32-bit values with zeros, i.e. 0xc66363a5 becomes 0x0c a50 Do that consistently for values in registers, the tables and the round keys, then: Without padded registers p00 = (uint32) y0 >> 21 p01 = (uint32) y0 >> 13 p02 = (uint32) y0 >> 5 p03 = (uint32) y0 << 3 p00 &= 0x7f8 p01 &= 0x7f8 p02 &= 0x7f8 p03 &= 0x7f8 Padded registers and 32-bit shift p00 = (uint64) y0 >> 48 p01 = (uint64) y0 >> 32 p02 = (uint32) y0 >> 16 p01 &= 0xff0 p03 = y0 & 0xff0 New AES software speed records 10
15 Counter-mode caching (saving about 100 instructions) Idea: Make use of the fact that AES is used in CTR mode A 16-byte counter is increased by 1 for every block 15 bytes of the counter remain constant for 256 blocks In the rst round most computations only depend on these 15 bytes 12 bytes of the output of the rst round remain constant for 256 blocks In the second round most computations only depend on these 12 bytes New AES software speed records 11
16 Counter-mode caching (saving about 100 instructions) Idea: Make use of the fact that AES is used in CTR mode A 16-byte counter is increased by 1 for every block 15 bytes of the counter remain constant for 256 blocks In the rst round most computations only depend on these 15 bytes 12 bytes of the output of the rst round remain constant for 256 blocks In the second round most computations only depend on these 12 bytes Do all these computations only once for 256 subsequent blocks and cache the result. New AES software speed records 11
17 Results Encryption speed given in cycles/byte for encrypting a block of 4096 bytes Veriable estream results Unveriable claims Architecture This paper Best previous Unpublished code UltraSPARC III (Bernstein) (Lipmaa) Power PC G (Wu) (Ahrens) Pentium 4 f (Bernstein) 15 (Osvik) Core 2 6fb (Wu) 14.5 (Matsui & Nakajima) Athlon (Wu) (Matsui) New AES software speed records 12
18 Results Encryption speed given in cycles/byte for encrypting a block of 4096 bytes Veriable estream results Unveriable claims Architecture This paper Best previous Unpublished code UltraSPARC III (Bernstein) (Lipmaa) Power PC G (Wu) (Ahrens) Pentium 4 f (Bernstein) 15 (Osvik) Core 2 6fb (Wu) 14.5 (Matsui & Nakajima) Athlon (Wu) (Matsui) Some post-paper results Measurements within the ebacs project on a Core : 9.31 cycles/byte Young reports 9.12 cycles/byte on a Core 2 6fb after integrating optimizations described in this paper New AES software speed records 12
19 Further information Paper and Software estream and ebacs qhasm New AES software speed records 13
New AES software speed records
New AES software speed records Daniel J. Bernstein 1 and Peter Schwabe 2 1 Department of Computer Science University of Illinois at Chicago, Chicago, IL 60607 7045, USA djb@cr.yp.to 2 Department of Mathematics
ChaCha, a variant of Salsa20
ChaCha, a variant of Salsa20 Daniel J. Bernstein Department of Mathematics, Statistics, and Computer Science (M/C 249) The University of Illinois at Chicago Chicago, IL 60607 7045 snuffle6@box.cr.yp.to
Salsa20/8 and Salsa20/12
Salsa20/8 and Salsa20/12 Daniel J. Bernstein Department of Mathematics, Statistics, and Computer Science (M/C 249) The University of Illinois at Chicago Chicago, IL 60607 7045 snuffle@box.cr.yp.to Introduction.
Software implementation of Post-Quantum Cryptography
Software implementation of Post-Quantum Cryptography Peter Schwabe Radboud University Nijmegen, The Netherlands October 20, 2013 ASCrypto 2013, Florianópolis, Brazil Part I Optimizing cryptographic software
Password-based encryption in ZIP files
Password-based encryption in ZIP files Dmitri Gabbasov December 15, 2015 Abstract In this report we give an overview of the encryption schemes used in the ZIP file format. We first give an overview of
6.857 Computer and Network Security Fall Term, 1997 Lecture 4 : 16 September 1997 Lecturer: Ron Rivest Scribe: Michelle Goldberg 1 Conditionally Secure Cryptography Conditionally (or computationally) secure
What output size resists collisions in a xor of independent expansions?
What output size resists collisions in a xor of independent expansions? Daniel J. Bernstein Department of Mathematics, Statistics, and Computer Science (MC 249) University of Illinois at Chicago, Chicago,
Fast Software AES Encryption
Calhoun: The NPS Institutional Archive Faculty and Researcher Publications Faculty and Researcher Publications 2010 Fast Software AES Encryption Osvik, Dag Arne Proceedings FSE'10 Proceedings of the 17th
ELECTENG702 Advanced Embedded Systems. Improving AES128 software for Altera Nios II processor using custom instructions
Assignment ELECTENG702 Advanced Embedded Systems Improving AES128 software for Altera Nios II processor using custom instructions October 1. 2005 Professor Zoran Salcic by Kilian Foerster 10-8 Claybrook
CSCE 465 Computer & Network Security
CSCE 465 Computer & Network Security Instructor: Dr. Guofei Gu http://courses.cse.tamu.edu/guofei/csce465/ Secret Key Cryptography (I) 1 Introductory Remarks Roadmap Feistel Cipher DES AES Introduction
Fast Implementations of AES on Various Platforms
Fast Implementations of AES on Various Platforms Joppe W. Bos 1 Dag Arne Osvik 1 Deian Stefan 2 1 EPFL IC IIF LACAL, Station 14, CH-1015 Lausanne, Switzerland {joppe.bos, dagarne.osvik}@epfl.ch 2 Dept.
SeChat: An AES Encrypted Chat
Name: Luis Miguel Cortés Peña GTID: 901 67 6476 GTG: gtg683t SeChat: An AES Encrypted Chat Abstract With the advancement in computer technology, it is now possible to break DES 56 bit key in a meaningful
High-speed high-security cryptography on ARMs
High-speed high-security cryptography on ARMs Daniel J. Bernstein Research Professor, University of Illinois at Chicago Professor, Cryptographic Implementations, Technische Universiteit Eindhoven Tanja
White Paper. Shay Gueron Intel Architecture Group, Israel Development Center Intel Corporation
White Paper Shay Gueron Intel Architecture Group, Israel Development Center Intel Corporation Intel Advanced Encryption Standard (AES) New Instructions Set Intel AES New Instructions are a set of instructions
A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc
Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr
Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr Copyright c 2007-2010 Xavier Clerc cadmium@x9c.fr Released under the LGPL version 3 February 6, 2010 Abstract: This
Efficient Software Implementation of AES on 32-bit Platforms
Efficient Software Implementation of AES on 32-bit Platforms Guido Bertoni, Luca Breveglieri Politecnico di Milano, Milano - Italy Pasqualina Lilli Lilli Fragneto AST-LAB of ST Microelectronics, Agrate
M.S. Project Proposal. SAT Based Attacks on SipHash
M.S. Project Proposal SAT Based Attacks on SipHash Santhosh Kantharaju Siddappa Department of Computer Science Rochester Institute of Technology Chair Prof. Alan Kaminsky Reader Prof. Stanisław P. Radziszowski
GPU File System Encryption Kartik Kulkarni and Eugene Linkov
GPU File System Encryption Kartik Kulkarni and Eugene Linkov 5/10/2012 SUMMARY. We implemented a file system that encrypts and decrypts files. The implementation uses the AES algorithm computed through
More on Pipelining and Pipelines in Real Machines CS 333 Fall 2006 Main Ideas Data Hazards RAW WAR WAW More pipeline stall reduction techniques Branch prediction» static» dynamic bimodal branch prediction
Hash Function JH and the NIST SHA3 Hash Competition
Hash Function JH and the NIST SHA3 Hash Competition Hongjun Wu Nanyang Technological University Presented at ACNS 2012 1 Introduction to Hash Function Hash Function Design Basics Hash function JH Design
ADVANCED PROCESSOR ARCHITECTURES AND MEMORY ORGANISATION Lesson-12: ARM
ADVANCED PROCESSOR ARCHITECTURES AND MEMORY ORGANISATION Lesson-12: ARM 1 The ARM architecture processors popular in Mobile phone systems 2 ARM Features ARM has 32-bit architecture but supports 16 bit
Cryptography and Network Security
Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 3: Block ciphers and DES Ion Petre Department of IT, Åbo Akademi University January 17, 2012 1 Data Encryption Standard
Breakthrough AES Performance with. Intel AES New Instructions
White Paper Breakthrough AES Performance with Intel AES New Instructions Kahraman Akdemir, Martin Dixon, Wajdi Feghali, Patrick Fay, Vinodh Gopal, Jim Guilford, Erdinc Ozturk, Gil Wolrich, Ronen Zohar
Designing Hash functions. Reviewing... Message Authentication Codes. and message authentication codes. We have seen how to authenticate messages:
Designing Hash functions and message authentication codes Reviewing... We have seen how to authenticate messages: Using symmetric encryption, in an heuristic fashion Using public-key encryption in interactive
MAC. SKE in Practice. Lecture 5
MAC. SKE in Practice. Lecture 5 Active Adversary Active Adversary An active adversary can inject messages into the channel Active Adversary An active adversary can inject messages into the channel Eve
How To Attack A Block Cipher With A Key Key (Dk) And A Key (K) On A 2Dns) On An Ipa (Ipa) On The Ipa 2Ds (Ipb) On Pcode)
Cryptography and Network Security Chapter 6 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 6 Block Cipher Operation Many savages at the present day regard
Intel Advanced Encryption Standard (AES) New Instructions Set
White Paper Shay Gueron Mobility Group, Israel Development Center Intel Corporation Intel Advanced Encryption Standard (AES) New Instructions Set Intel AES New Instructions are a set of instructions available
AES-GCM software performance on the current high end CPUs as a performance baseline for CAESAR competition
Directions in Authenticated Ciphers DIAC 2013, 11 13 August 2013, Chicago, USA AES-GCM software performance on the current high end CPUs as a performance baseline for CAESAR competition Shay Gueron University
Intel s New AES Instructions for Enhanced Performance and Security
Intel s New AES Instructions for Enhanced Performance and Security Shay Gueron 1,2 1 Intel Corporation, Mobility Group, Israel Development Center, Haifa, Israel 2 University of Haifa, Faculty of Science,
The Misuse of RC4 in Microsoft Word and Excel
The Misuse of RC4 in Microsoft Word and Excel Hongjun Wu Institute for Infocomm Research, Singapore hongjun@i2r.a-star.edu.sg Abstract. In this report, we point out a serious security flaw in Microsoft
Fast Arithmetic Coding (FastAC) Implementations
Fast Arithmetic Coding (FastAC) Implementations Amir Said 1 Introduction This document describes our fast implementations of arithmetic coding, which achieve optimal compression and higher throughput by
Sosemanuk, a fast software-oriented stream cipher
Sosemanuk, a fast software-oriented stream cipher C. Berbain 1, O. Billet 1, A. Canteaut 2, N. Courtois 3, H. Gilbert 1, L. Goubin 4, A. Gouget 5, L. Granboulan 6, C. Lauradoux 2, M. Minier 2, T. Pornin
Table of Contents. Bibliografische Informationen http://d-nb.info/996514864. digitalisiert durch
1 Introduction to Cryptography and Data Security 1 1.1 Overview of Cryptology (and This Book) 2 1.2 Symmetric Cryptography 4 1.2.1 Basics 4 1.2.2 Simple Symmetric Encryption: The Substitution Cipher...
TCG Algorithm Registry. Family 2.0" Level 00 Revision 01.15. April 17, 2014. Published. Contact: admin@trustedcomputinggroup.org.
Family 2.0" Level 00 Revision 01.15 April 17, 2014 Published Contact: admin@trustedcomputinggroup.org TCG TCG Published Copyright TCG 2014 Disclaimers, Notices, and License Terms THIS SPECIFICATION IS
The mathematics of RAID-6
The mathematics of RAID-6 H. Peter Anvin 1 December 2004 RAID-6 supports losing any two drives. The way this is done is by computing two syndromes, generally referred P and Q. 1 A quick
Processor Accelerator for AES
1 Processor Accelerator for AES Ruby B. Lee and Yu-Yuan Chen Department of Electrical Engineering Princeton University rblee, yctwo@princeton.edu Abstract Software AES cipher performance is not fast enough
Implementation of Full -Parallelism AES Encryption and Decryption
Implementation of Full -Parallelism AES Encryption and Decryption M.Anto Merline M.E-Commuication Systems, ECE Department K.Ramakrishnan College of Engineering-Samayapuram, Trichy. Abstract-Advanced Encryption
Memory ICS 233. Computer Architecture and Assembly Language Prof. Muhamed Mudawar
Memory ICS 233 Computer Architecture and Assembly Language Prof. Muhamed Mudawar College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Presentation Outline Random
A Comparative Study Of Two Symmetric Encryption Algorithms Across Different Platforms.
A Comparative Study Of Two Symmetric Algorithms Across Different Platforms. Dr. S.A.M Rizvi 1,Dr. Syed Zeeshan Hussain 2 and Neeta Wadhwa 3 Deptt. of Computer Science, Jamia Millia Islamia, New Delhi,
MarshallSoft AES. (Advanced Encryption Standard) Reference Manual
MarshallSoft AES (Advanced Encryption Standard) Reference Manual (AES_REF) Version 3.0 May 6, 2015 This software is provided as-is. There are no warranties, expressed or implied. Copyright (C) 2015 All
CAESAR candidate PiCipher
CAESAR candidate PiCipher Danilo Gligoroski, ITEM, NTNU, Norway Hristina Mihajloska, FCSE, UKIM, Macedonia Simona Samardjiska, ITEM, NTNU, Norway and FCSE, UKIM, Macedonia Håkon Jacobsen, ITEM, NTNU, Norway
RPDO 1 TPDO 1 TPDO 5 TPDO 6 TPDO 7 TPDO 8
EN ZC - 6DI8DO CANopen I/O Module 6 Digital Input 8 Digital Output Or 8 Counters (3 bit) 8 Digital input 8 Digital output User Manual Contents: Features PDOs PDO Type Emergency Message Functional Diagrams
Haswell Cryptographic Performance
White Paper Sean Gulley Vinodh Gopal IA Architects Intel Corporation Haswell Cryptographic Performance July 2013 329282-001 Executive Summary The new Haswell microarchitecture featured in the 4 th generation
QUIC. Quick UDP Internet Connections. Multiplexed Stream Transport over UDP. IETF-88 TSV Area Presentation 2013-11-7
QUIC Quick UDP Internet Connections Multiplexed Stream Transport over UDP Presentation by Jim Roskind Google Corp IETF-88 TSV Area Presentation 2013-11-7 What is QUIC? Effectively replaces TLS and
CLOUD COMPUTING SECURITY ARCHITECTURE - IMPLEMENTING DES ALGORITHM IN CLOUD FOR DATA SECURITY
CLOUD COMPUTING SECURITY ARCHITECTURE - IMPLEMENTING DES ALGORITHM IN CLOUD FOR DATA SECURITY Varun Gandhi 1 Department of Computer Science and Engineering, Dronacharya College of Engineering, Khentawas,
Communicating with devices
Introduction to I/O Where does the data for our CPU and memory come from or go to? Computers communicate with the outside world via I/O devices. Input devices supply computers with data to operate on.
Error oracle attacks and CBC encryption. Chris Mitchell ISG, RHUL http://www.isg.rhul.ac.uk/~cjm
Error oracle attacks and CBC encryption Chris Mitchell ISG, RHUL http://www.isg.rhul.ac.uk/~cjm Agenda 1. Introduction 2. CBC mode 3. Error oracles 4. Example 1 5. Example 2 6. Example 3 7. Stream ciphers
Processing Multiple Buffers in Parallel to Increase Performance on Intel Architecture Processors
White Paper Vinodh Gopal Jim Guilford Wajdi Feghali Erdinc Ozturk Gil Wolrich Martin Dixon IA Architects Intel Corporation Processing Multiple Buffers in Parallel to Increase Performance on Intel Architecture
High-Performance Modular Multiplication on the Cell Processor
High-Performance Modular Multiplication on the Cell Processor Joppe W. Bos Laboratory for Cryptologic Algorithms EPFL, Lausanne, Switzerland joppe.bos@epfl.ch 1 / 19 Outline Motivation and previous work
CPU Organization and Assembly Language
COS 140 Foundations of Computer Science School of Computing and Information Science University of Maine October 2, 2015 Outline 1 2 3 4 5 6 7 8 Homework and announcements Reading: Chapter 12 Homework:
ELEG3924 Microprocessor Ch.7 Programming In C
Department of Electrical Engineering University of Arkansas ELEG3924 Microprocessor Ch.7 Programming In C Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Data types and time delay I/O programming and Logic operations
Comparing Performance of Software CLEFIA to Established Block Ciphers on 8-bit Devices
Comparing Performance of Software CLEFIA to Established Block Ciphers on 8-bit Devices Rembrand van Lakwijk University of Twente P.O. Box 217, 7500AE Enschede The Netherlands r.g.j.f.o.vanlakwijk@student.utwente.nl
Using the RDTSC Instruction for Performance Monitoring
Using the Instruction for Performance Monitoring http://developer.intel.com/drg/pentiumii/appnotes/pm1.htm Using the Instruction for Performance Monitoring Information in this document is provided in connection
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor Bruce Schneier Doug Whiting Counterpane Systems Stac Electronics 101 E Minnehaha Parkway
Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
Network Security - ISA 656 Introduction to Cryptography
Network Security - ISA 656 Angelos Stavrou September 18, 2007 Codes vs. K = {0, 1} l P = {0, 1} m C = {0, 1} n, C C E : P K C D : C K P p P, k K : D(E(p, k), k) = p It is infeasible to find F : P C K Let
How To Write A Hexadecimal Program
The mathematics of RAID-6 H. Peter Anvin First version 20 January 2004 Last updated 20 December 2011 RAID-6 supports losing any two drives. syndromes, generally referred P and Q. The way
CSci 530 Midterm Exam. Fall 2012
CSci 530 Midterm Exam Fall 2012 Instructions: Show all work. No electronic devices are allowed. This exam is open book, open notes. You have 100 minutes to complete the exam. Please prepare your answers
EE361: Digital Computer Organization Course Syllabus
EE361: Digital Computer Organization Course Syllabus Dr. Mohammad H. Awedh Spring 2014 Course Objectives Simply, a computer is a set of components (Processor, Memory and Storage, Input/Output Devices)
Performance Evaluation of NAS Parallel Benchmarks on Intel Xeon Phi
Performance Evaluation of NAS Parallel Benchmarks on Intel Xeon Phi ICPP 6 th International Workshop on Parallel Programming Models and Systems Software for High-End Computing October 1, 2013 Lyon, France
Computer Performance. Topic 3. Contents. Prerequisite knowledge Before studying this topic you should be able to:
55 Topic 3 Computer Performance Contents 3.1 Introduction...................................... 56 3.2 Measuring performance............................... 56 3.2.1 Clock Speed.................................
AES-GCM for Efficient Authenticated Encryption Ending the Reign of HMAC-SHA-1?
Workshop on Real-World Cryptography Stanford University Jan. 9-11, 2013 AES-GCM for Efficient Authenticated Encryption Ending the Reign of HMAC-SHA-1? Shay Gueron University of Haifa Department of Mathematics,
GPON 984.3. Section 12-14 Reporter: 王 依 盈 94.10.26
GPON 984.3 Section 12-14 Reporter: 王 依 盈 94.10.26 Outline Security Forward Error Correction OMCI Transport Mechanism Security Basic Threat Model Encryption System Key exchange and switch-over Forward Error
Soft-Starter SSW-06 V1.6X
Motors Energy Automation Coatings Soft-Starter SSW-06 V1.6X Serial Communication Manual Language: English Document: 0899.5731 / 04 Serial Communication Manual Series: SSW-06 V1.6X Language: English Document
The Stream Cipher HC-128
The Stream Cipher HC-128 Hongjun Wu Katholieke Universiteit Leuven, ESAT/SCD-COSIC Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium wu.hongjun@esat.kuleuven.be Statement 1. HC-128 supports 128-bit
Efficient Low-Level Software Development for the i.mx Platform
Freescale Semiconductor Application Note Document Number: AN3884 Rev. 0, 07/2009 Efficient Low-Level Software Development for the i.mx Platform by Multimedia Applications Division Freescale Semiconductor,
Definition of RAID Levels
RAID The basic idea of RAID (Redundant Array of Independent Disks) is to combine multiple inexpensive disk drives into an array of disk drives to obtain performance, capacity and reliability that exceeds
CPU performance monitoring using the Time-Stamp Counter register
CPU performance monitoring using the Time-Stamp Counter register This laboratory work introduces basic information on the Time-Stamp Counter CPU register, which is used for performance monitoring. The
Network Security. Security. Security Services. Crytographic algorithms. privacy authenticity Message integrity. Public key (RSA) Message digest (MD5)
Network Security Security Crytographic algorithms Security Services Secret key (DES) Public key (RSA) Message digest (MD5) privacy authenticity Message integrity Secret Key Encryption Plain text Plain
Triathlon of Lightweight Block Ciphers for the Internet of Things
NIST Lightweight Cryptography Workshop 2015 Triathlon of Lightweight Block Ciphers for the Internet of Things Daniel Dinu, Yann Le Corre, Dmitry Khovratovich, Leo Perrin, Johann Großschädl, Alex Biryukov
Computer Architecture Lecture 2: Instruction Set Principles (Appendix A) Chih Wei Liu 劉 志 尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.
Computer Architecture Lecture 2: Instruction Set Principles (Appendix A) Chih Wei Liu 劉 志 尉 National Chiao Tung University cwliu@twins.ee.nctu.edu.tw Review Computers in mid 50 s Hardware was expensive
Instruction Set Architecture (ISA)
Instruction Set Architecture (ISA) * Instruction set architecture of a machine fills the semantic gap between the user and the machine. * ISA serves as the starting point for the design of a new machine
ETHERNET ENCRYPTION MODES TECHNICAL-PAPER
1 ETHERNET ENCRYPTION MODES TECHNICAL-PAPER The CN series encryption platform is designed to secure information transmitted over a number of network protocols. The CN series encryptors secure Ethernet
Technical Specification Digital Video Broadcasting (DVB); Content Scrambling Algorithms for DVB-IPTV Services using MPEG2 Transport Streams
TS 103 127 V1.1.1 (2013-05) Technical Specification Digital Video Broadcasting (DVB); Content Scrambling Algorithms for DVB-IPTV Services using MPEG2 Transport Streams 2 TS 103 127 V1.1.1 (2013-05) Reference
Wireless ATA: A New Data Transport Protocol for Wireless Storage
Wireless ATA: A New Data Transport Protocol for Wireless Storage Serdar Ozler and Ibrahim Korpeoglu Department of Computer Engineering, Bilkent University, 06800 Bilkent, Ankara, Turkey {ozler, korpe}@cs.bilkent.edu.tr
Secret File Sharing Techniques using AES algorithm. C. Navya Latha 200201066 Garima Agarwal 200305032 Anila Kumar GVN 200305002
Secret File Sharing Techniques using AES algorithm C. Navya Latha 200201066 Garima Agarwal 200305032 Anila Kumar GVN 200305002 1. Feature Overview The Advanced Encryption Standard (AES) feature adds support
ACR122 NFC Contactless Smart Card Reader
Datenblatt / Specifications ACR122 NFC Contactless Smart Card Reader Table of Contents 1. Introduction... 3 1.1. USB Interface... 3 2. Implementation... 4 2.1. Smart Card Reader Interface Overview... 5
LSN 2 Computer Processors
LSN 2 Computer Processors Department of Engineering Technology LSN 2 Computer Processors Microprocessors Design Instruction set Processor organization Processor performance Bandwidth Clock speed LSN 2
Computer Architecture. Secure communication and encryption.
Computer Architecture. Secure communication and encryption. Eugeniy E. Mikhailov The College of William & Mary Lecture 28 Eugeniy Mikhailov (W&M) Practical Computing Lecture 28 1 / 13 Computer architecture
Message authentication
Message authentication -- Hash based MAC unctions -- MAC unctions based on bloc ciphers -- Authenticated encryption (c) Levente Buttyán (buttyan@crysys.hu) Secret preix method MAC (x) = H( x) insecure!
Pipelining Review and Its Limitations
Pipelining Review and Its Limitations Yuri Baida yuri.baida@gmail.com yuriy.v.baida@intel.com October 16, 2010 Moscow Institute of Physics and Technology Agenda Review Instruction set architecture Basic
Nemo 96HD/HD+ MODBUS
18/12/12 Pagina 1 di 28 MULTIFUNCTION FIRMWARE 2.30 Nemo 96HD/HD+ MODBUS COMMUNICATION PROTOCOL CONTENTS 1.0 ABSTRACT 2.0 DATA MESSAGE DESCRIPTION 2.1 Parameters description 2.2 Data format 2.3 Description
1 Step 1: Select... Files to Encrypt 2 Step 2: Confirm... Name of Archive 3 Step 3: Define... Pass Phrase
Contents I Table of Contents Foreword 0 Part I Introduction 2 1 What is?... 2 Part II Encrypting Files 1,2,3 2 1 Step 1: Select... Files to Encrypt 2 2 Step 2: Confirm... Name of Archive 3 3 Step 3: Define...
Cryptography and Network Security Chapter 3
Cryptography and Network Security Chapter 3 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 3 Block Ciphers and the Data Encryption Standard All the afternoon
Performance Characterization of SPEC CPU2006 Integer Benchmarks on x86-64 64 Architecture
Performance Characterization of SPEC CPU2006 Integer Benchmarks on x86-64 64 Architecture Dong Ye David Kaeli Northeastern University Joydeep Ray Christophe Harle AMD Inc. IISWC 2006 1 Outline Motivation
Chapter 8. Network Security
Chapter 8 Network Security Cryptography Introduction to Cryptography Substitution Ciphers Transposition Ciphers One-Time Pads Two Fundamental Cryptographic Principles Need for Security Some people who
Secondary Storage. Any modern computer system will incorporate (at least) two levels of storage: magnetic disk/optical devices/tape systems
1 Any modern computer system will incorporate (at least) two levels of storage: primary storage: typical capacity cost per MB $3. typical access time burst transfer rate?? secondary storage: typical capacity
Automata Designs for Data Encryption with AES using the Micron Automata Processor
IJCSNS International Journal of Computer Science and Network Security, VOL.15 No.7, July 2015 1 Automata Designs for Data Encryption with AES using the Micron Automata Processor Angkul Kongmunvattana School
How To Understand And Understand The History Of Cryptography
CSE497b Introduction to Computer and Network Security - Spring 2007 - Professors Jaeger Lecture 5 - Cryptography CSE497b - Spring 2007 Introduction Computer and Network Security Professor Jaeger www.cse.psu.edu/~tjaeger/cse497b-s07/
APRIL 2010 HIGH PERFORMANCE NETWORK SECURITY APPLIANCES
APRIL 21 HIGH PERFORMANCE NETWORK SECURITY APPLIANCES The more you can process, the more value your network security appliance provides Disclaimer: This document is intended for informational purposes
Application Note. Introduction AN2471/D 3/2003. PC Master Software Communication Protocol Specification
Application Note 3/2003 PC Master Software Communication Protocol Specification By Pavel Kania and Michal Hanak S 3 L Applications Engineerings MCSL Roznov pod Radhostem Introduction The purpose of this
How To Encrypt With A 64 Bit Block Cipher
The Data Encryption Standard (DES) As mentioned earlier there are two main types of cryptography in use today - symmetric or secret key cryptography and asymmetric or public key cryptography. Symmetric
Advanced Encryption Standard by Example. 1.0 Preface. 2.0 Terminology. Written By: Adam Berent V.1.7
Written By: Adam Berent Advanced Encryption Standard by Example V.1.7 1.0 Preface The following document provides a detailed and easy to understand explanation of the implementation of the AES (RIJNDAEL)
Modes of Operation of Block Ciphers
Chapter 3 Modes of Operation of Block Ciphers A bitblock encryption function f: F n 2 Fn 2 is primarily defined on blocks of fixed length n To encrypt longer (or shorter) bit sequences the sender must
NXP & Security Innovation Encryption for ARM MCUs
NXP & Security Innovation Encryption for ARM MCUs Presenters Gene Carter- International Product Manager, NXP Semiconductors Gene is responsible for marketing of the ARM7 and Cortex-M3 microcontrollers.
Comparative Performance Review of SHA-3 Candidates
Comparative Performance Review of the SHA-3 Second-Round Candidates Cryptolog International Second SHA-3 Candidate Conference Outline sphlib sphlib sphlib is an open-source implementation of many hash
Master of Science in Computer Science and Engineering Thesis: Fast Flexible Architectures for Secure Communication
Master of Science in Computer Science and Engineering Thesis: Fast Flexible Architectures for Secure Communication Lisa Wu Advanced Computer Architecture Laboratory University of Michigan Ann Arbor, MI
Visualisation of potential weakness of existing cipher engine implementations in commercial on-the-fly disk encryption software
Visualisation of potential weakness of existing cipher engine implementations in commercial on-the-fly disk encryption software C. B. Roellgen Global IP Telecommunications, Ltd. & PMC Ciphers, Inc. August
Advanced Encryption Standard by Example. 1.0 Preface. 2.0 Terminology. Written By: Adam Berent V.1.5
Written By: Adam Berent Advanced Encryption Standard by Example V.1.5 1.0 Preface The following document provides a detailed and easy to understand explanation of the implementation of the AES (RIJNDAEL)