SHA-3, Keccak & Sponge function
•Download as PPTX, PDF•
4 likes•8,980 views
Summary description of the sponge function, Keccak and the future Security Hash Algorithm (SHA) Standard.
Report
Share
Report
Share
Recommended
Sha3
The document summarizes the SHA3 hash algorithm competition hosted by NIST. It provides details on the winning algorithm called Keccak, including its sponge construction, Keccak-f permutation, and the algorithms used in each round. Performance experiments show SHA3-512 is slower than SHA256 but provides stronger security guarantees. In conclusion, SHA3 will be the next hash standard and Keccak offers a secure design suited for hardware implementations.
Keccak
This document provides an overview of the Keccak hash function and sponge construction. It describes how Keccak was selected as the winner of the NIST hash function competition in 2012. The core of Keccak is the Keccak-f permutation, which applies 5 modules (Theta, Rho, Pi, Chi, Iota) over multiple rounds to diffuse bits across a 3D state array. Keccak offers flexibility in hash output size, parallelism for efficiency, and resistance to side-channel attacks. It finds applications in digital signatures, data integrity, password storage, and authenticated encryption.
SHA-3
The document discusses the SHA-3 algorithm, which is the latest member of the Secure Hash Algorithm family of standards released by NIST in 2015. It provides an overview of the limitations of previous SHA standards like SHA-1 and SHA-2, the history and design of SHA-3, which uses the Keccak algorithm and sponge construction. Later sections cover specifics of SHA-3 like padding, the block permutation, and implementations in various cryptography libraries.
MAC-Message Authentication Codes
Brief Presentation about message authentication codes and HMAC with requirements, functions and security issues in cryptography
DES
DES was developed as a standard for communications and data protection by an IBM research team in response to a request from the National Bureau of Standards (now called NIST). DES uses the techniques of confusion and diffusion achieved through numerous permutations and the XOR operation. The basic DES process encrypts a 64-bit block using a 56-bit key over 16 complex rounds consisting of permutations and key-dependent calculations. Triple DES was developed as a more secure version of DES.
Hash function
The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Two fish cipher
Twofish is a symmetric block cipher with a 128-bit block size and key sizes of 128, 192, or 256 bits. It was designed by Bruce Schneier as an algorithm that is a combination of Blowfish and Square. The Twofish algorithm uses a 16-round structure where the plaintext is divided into four 32-bit words that are xored with key words and undergo transformations in each round before being swapped and combined to produce the ciphertext. Each round uses g-functions consisting of S-boxes and an MDS matrix, along with a PHT to diffuse the outputs which are then combined with key words.
Hash Function & Analysis
This document discusses hash functions and their analysis for a network security seminar. It begins by defining a hash function as a mathematical function that converts a large amount of data into a small string of integers. Common applications of hash functions include hash tables for quickly searching data, eliminating data redundancy, caches, bloom filters, and pattern matching. Cryptographic hash functions have properties like preimage and second preimage resistance as well as collision resistance. Popular cryptographic hash functions discussed include MD2, MD4, MD5, SHA-1, and SHA-2, along with their advantages, limitations, and examples of attacks.
Recommended
Sha3
The document summarizes the SHA3 hash algorithm competition hosted by NIST. It provides details on the winning algorithm called Keccak, including its sponge construction, Keccak-f permutation, and the algorithms used in each round. Performance experiments show SHA3-512 is slower than SHA256 but provides stronger security guarantees. In conclusion, SHA3 will be the next hash standard and Keccak offers a secure design suited for hardware implementations.
Keccak
This document provides an overview of the Keccak hash function and sponge construction. It describes how Keccak was selected as the winner of the NIST hash function competition in 2012. The core of Keccak is the Keccak-f permutation, which applies 5 modules (Theta, Rho, Pi, Chi, Iota) over multiple rounds to diffuse bits across a 3D state array. Keccak offers flexibility in hash output size, parallelism for efficiency, and resistance to side-channel attacks. It finds applications in digital signatures, data integrity, password storage, and authenticated encryption.
SHA-3
The document discusses the SHA-3 algorithm, which is the latest member of the Secure Hash Algorithm family of standards released by NIST in 2015. It provides an overview of the limitations of previous SHA standards like SHA-1 and SHA-2, the history and design of SHA-3, which uses the Keccak algorithm and sponge construction. Later sections cover specifics of SHA-3 like padding, the block permutation, and implementations in various cryptography libraries.
MAC-Message Authentication Codes
Brief Presentation about message authentication codes and HMAC with requirements, functions and security issues in cryptography
DES
DES was developed as a standard for communications and data protection by an IBM research team in response to a request from the National Bureau of Standards (now called NIST). DES uses the techniques of confusion and diffusion achieved through numerous permutations and the XOR operation. The basic DES process encrypts a 64-bit block using a 56-bit key over 16 complex rounds consisting of permutations and key-dependent calculations. Triple DES was developed as a more secure version of DES.
Hash function
The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.
Two fish cipher
Twofish is a symmetric block cipher with a 128-bit block size and key sizes of 128, 192, or 256 bits. It was designed by Bruce Schneier as an algorithm that is a combination of Blowfish and Square. The Twofish algorithm uses a 16-round structure where the plaintext is divided into four 32-bit words that are xored with key words and undergo transformations in each round before being swapped and combined to produce the ciphertext. Each round uses g-functions consisting of S-boxes and an MDS matrix, along with a PHT to diffuse the outputs which are then combined with key words.
Hash Function & Analysis
This document discusses hash functions and their analysis for a network security seminar. It begins by defining a hash function as a mathematical function that converts a large amount of data into a small string of integers. Common applications of hash functions include hash tables for quickly searching data, eliminating data redundancy, caches, bloom filters, and pattern matching. Cryptographic hash functions have properties like preimage and second preimage resistance as well as collision resistance. Popular cryptographic hash functions discussed include MD2, MD4, MD5, SHA-1, and SHA-2, along with their advantages, limitations, and examples of attacks.
CNIT 141 8. Authenticated Encryption
A college course in Cryptography and Cryptocurrency
More info: https://samsclass.info/141/141_F21.shtml
Data encryption standard
This document summarizes a chapter about the Data Encryption Standard (DES). It provides an overview of DES, describing it as a symmetric-key block cipher developed by IBM and adopted by the National Institute of Standards and Technology. The chapter then goes into details about the structure and design of DES, including its use of an initial and final permutation, 16 rounds of encryption using subkey values, and weaknesses like its short key length. It also discusses analyses of DES security, noting brute force, differential cryptanalysis, and linear cryptanalysis as potential attack methods.
symmetric key encryption algorithms
Symmetric Key Encryption Algorithms can be categorized as stream ciphers or block ciphers. Block ciphers like the Data Encryption Standard (DES) operate on fixed-length blocks of bits, while stream ciphers process messages bit-by-bit. DES is an example of a block cipher that encrypts 64-bit blocks using a 56-bit key. International Data Encryption Algorithm (IDEA) is another block cipher that uses a 128-bit key and 64-bit blocks, employing addition and multiplication instead of XOR like DES. IDEA consists of 8 encryption rounds followed by an output transformation to generate the ciphertext from the plaintext and key.
4. The Advanced Encryption Standard (AES)
A lecture for a college course -- CNIT 140: Cryptography for Computer Networks at City College San Francisco
Based on "Understanding Cryptography: A Textbook for Students and Practitioners" by Christof Paar, Jan Pelzl, and Bart Preneel, ISBN: 3642041000
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_F17.shtml
CNIT 141: 5. Stream Ciphers
For a college course -- CNIT 141: Cryptography for Computer Networks, at City College San Francisco
Based on "Serious Cryptography: A Practical Introduction to Modern Encryption", by Jean-Philippe Aumasson, No Starch Press (November 6, 2017), ISBN-10: 1593278268 ISBN-13: 978-1593278267
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_S19.shtml
AES KEY EXPANSION .pptx
The document describes the AES key expansion process. The AES algorithm takes a 128-bit key as input and expands it into a linear array of 44 words using a key schedule. The key schedule applies the key expansion function g, which performs byte substitutions and XOR operations with round constants, to generate a key for each round. The initial key is added to the first four words of the expanded key schedule.
Ch03 block-cipher-and-data-encryption-standard
This document summarizes Chapter 3 of the textbook "Cryptography and Network Security" by William Stallings. It discusses block ciphers and the Data Encryption Standard (DES). Specifically, it provides an overview of modern block ciphers and DES, including the history and design of DES, how it works using a Feistel cipher structure, and analyses of the strength and security of DES. It also covers differential cryptanalysis as an analytic attack against block ciphers like DES.
Rc4
The document discusses cryptographic algorithms and keys. It describes the RC4 algorithm which uses a key stream to encrypt plaintext into ciphertext. It involves initializing a state array S with permutations, then generating a pseudo-random key stream by swapping array bytes based on the key and indices i and j. The key stream is then combined with plaintext to produce ciphertext. The document also mentions SSL and provides several references on RC4, WEP attacks, and cryptographic algorithm breakdowns.
Idea (international data encryption algorithm)
IDEA is a symmetric block cipher algorithm developed in 1990 as a replacement for the Data Encryption Standard. It uses a 128-bit key to encrypt 64-bit blocks of plaintext into ciphertext. The key is divided into 52 subkeys that are used over 8 rounds of mixing and substitution operations including XOR, addition, and multiplication. IDEA was used in PGP v2.0 and has applications in encrypting sensitive data for financial services, broadcasting, government use, and more.
RC4&RC5
RC4 is a symmetric key stream cipher algorithm invented in 1987. It operates by combining a pseudo-random keystream with plaintext using XOR operations. The keystream is generated from an initial random permutation of bytes. RC4 has been used to encrypt network traffic but weaknesses have been found, including biases in the early output bytes that allow recovery of encryption keys. While simple and fast, RC4 is no longer considered secure for many applications.
DES (Data Encryption Standard) pressentation
This document discusses data encryption methods. It defines encryption as hiding information so it can only be accessed by those with the key. There are two main types: symmetric encryption uses one key, while asymmetric encryption uses two different but related keys. Encryption works by scrambling data using techniques like transposition, which rearranges the order, and substitution, which replaces parts with other values. The document specifically describes the Data Encryption Standard (DES) algorithm and the public key cryptosystem, which introduced the innovative approach of using different keys for encryption and decryption.
Hash Function
This document discusses message authentication techniques including message encryption, message authentication codes (MACs), and hash functions. It describes how each technique can be used to authenticate messages and protect against various security threats. It also covers how symmetric and asymmetric encryption can provide authentication when used with MACs or digital signatures. Specific MAC and hash functions are examined like HMAC, SHA-1, and SHA-2. X.509 is introduced as a standard for digital certificates.
Message Authentication Code & HMAC
This document discusses message authentication codes (MACs). It explains that MACs use a shared symmetric key to authenticate messages, ensuring integrity and validating the sender. The document outlines the MAC generation and verification process, and notes that MACs provide authentication but not encryption. It then describes HMAC specifically, which applies a cryptographic hash function to the message and key to generate the MAC. The key steps of the HMAC process are detailed.
Blow fish final ppt
This document discusses the design and implementation of the Blowfish encryption algorithm using Verilog HDL. Blowfish is a symmetric block cipher that uses a variable-length key from 32 to 448 bits, making it suitable for securing data. The algorithm consists of two parts - key expansion and a round structure involving 16 rounds of operations. The authors implemented Blowfish using Verilog HDL on a Xilinx FPGA for applications requiring encryption like IoT devices. Their design achieved high-speed encryption of up to 4 bits per clock cycle and operated at a maximum frequency of 50MHz.
Design and Simulation Triple-DES
The document discusses the simulation of a Triple Data Encryption Standard (Triple DES) circuit using VHDL. It provides background on Triple DES, describes the design and structure of the Triple DES circuit in VHDL, and presents the results of testing the encryption and decryption functions of the circuit through simulation. Testing showed the circuit correctly performed encryption and decryption on input data using the Triple DES algorithm. The design utilized some FPGA resources but would require a clock generator and RAM for implementation on an actual FPGA board.
Cryptographic Algorithms: DES and RSA
A very clear presentation on Crytographic Alogotithms DES and RSA with basic concepts of cryptography. This presented by students of Techno India, Salt Lake.
CS6701 CRYPTOGRAPHY AND NETWORK SECURITY
HASH FUNCTIONS AND DIGITAL SIGNATURES
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 – SHA – HMAC – CMAC – Digital signature and authentication protocols – DSS – EI Gamal – Schnorr.
Elliptic curve cryptography
Elliptic Curve Cryptography was presented by Ajithkumar Vyasarao. He began with an introduction to ECC, noting its advantages over RSA like smaller key sizes providing equal security. He described how ECC works using elliptic curves over real numbers and finite fields. He demonstrated point addition and scalar multiplication on curves. ECC can be used for applications like smart cards and mobile devices. For key exchange, Alice and Bob can agree on a starting point and generate secret keys by multiplying a private value with the shared point. ECC provides security through the difficulty of solving the elliptic curve discrete logarithm problem.
Hash Function
A hash function maps data of arbitrary size to a fixed size value called a hash. Common hash functions include MD5 and SHA, with MD5 producing a 128-bit hash. While hashes were once used to securely store passwords, MD5 is now considered cryptographically broken due to collisions being found in its compression function. One-way signatures allow multiple users to generate linked signatures on the same message in a verifiable chain.
AES-Advanced Encryption Standard
Advanced Encryption Standard. What is AES? Why AES? Cryptography. Working of AES. Attacks on AES. Full working description of AES.
The SHA Hashing Algorithm
An introduction to the SHA Hashing Algorithm. The origins of SHA are explained, along with the family taxonomy of SHA message digest functions. We also cover their uses in cryptography. http://boblandstrom.com
Secure Hash Algorithm (SHA-512)
Secure Hash Algorithm 512 (SHA-512) description with figure and equation according to the book of Behrauz A. Forouzan and internet searching.
More Related Content
What's hot
CNIT 141 8. Authenticated Encryption
A college course in Cryptography and Cryptocurrency
More info: https://samsclass.info/141/141_F21.shtml
Data encryption standard
This document summarizes a chapter about the Data Encryption Standard (DES). It provides an overview of DES, describing it as a symmetric-key block cipher developed by IBM and adopted by the National Institute of Standards and Technology. The chapter then goes into details about the structure and design of DES, including its use of an initial and final permutation, 16 rounds of encryption using subkey values, and weaknesses like its short key length. It also discusses analyses of DES security, noting brute force, differential cryptanalysis, and linear cryptanalysis as potential attack methods.
symmetric key encryption algorithms
Symmetric Key Encryption Algorithms can be categorized as stream ciphers or block ciphers. Block ciphers like the Data Encryption Standard (DES) operate on fixed-length blocks of bits, while stream ciphers process messages bit-by-bit. DES is an example of a block cipher that encrypts 64-bit blocks using a 56-bit key. International Data Encryption Algorithm (IDEA) is another block cipher that uses a 128-bit key and 64-bit blocks, employing addition and multiplication instead of XOR like DES. IDEA consists of 8 encryption rounds followed by an output transformation to generate the ciphertext from the plaintext and key.
4. The Advanced Encryption Standard (AES)
A lecture for a college course -- CNIT 140: Cryptography for Computer Networks at City College San Francisco
Based on "Understanding Cryptography: A Textbook for Students and Practitioners" by Christof Paar, Jan Pelzl, and Bart Preneel, ISBN: 3642041000
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_F17.shtml
CNIT 141: 5. Stream Ciphers
For a college course -- CNIT 141: Cryptography for Computer Networks, at City College San Francisco
Based on "Serious Cryptography: A Practical Introduction to Modern Encryption", by Jean-Philippe Aumasson, No Starch Press (November 6, 2017), ISBN-10: 1593278268 ISBN-13: 978-1593278267
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_S19.shtml
AES KEY EXPANSION .pptx
The document describes the AES key expansion process. The AES algorithm takes a 128-bit key as input and expands it into a linear array of 44 words using a key schedule. The key schedule applies the key expansion function g, which performs byte substitutions and XOR operations with round constants, to generate a key for each round. The initial key is added to the first four words of the expanded key schedule.
Ch03 block-cipher-and-data-encryption-standard
This document summarizes Chapter 3 of the textbook "Cryptography and Network Security" by William Stallings. It discusses block ciphers and the Data Encryption Standard (DES). Specifically, it provides an overview of modern block ciphers and DES, including the history and design of DES, how it works using a Feistel cipher structure, and analyses of the strength and security of DES. It also covers differential cryptanalysis as an analytic attack against block ciphers like DES.
Rc4
The document discusses cryptographic algorithms and keys. It describes the RC4 algorithm which uses a key stream to encrypt plaintext into ciphertext. It involves initializing a state array S with permutations, then generating a pseudo-random key stream by swapping array bytes based on the key and indices i and j. The key stream is then combined with plaintext to produce ciphertext. The document also mentions SSL and provides several references on RC4, WEP attacks, and cryptographic algorithm breakdowns.
Idea (international data encryption algorithm)
IDEA is a symmetric block cipher algorithm developed in 1990 as a replacement for the Data Encryption Standard. It uses a 128-bit key to encrypt 64-bit blocks of plaintext into ciphertext. The key is divided into 52 subkeys that are used over 8 rounds of mixing and substitution operations including XOR, addition, and multiplication. IDEA was used in PGP v2.0 and has applications in encrypting sensitive data for financial services, broadcasting, government use, and more.
RC4&RC5
RC4 is a symmetric key stream cipher algorithm invented in 1987. It operates by combining a pseudo-random keystream with plaintext using XOR operations. The keystream is generated from an initial random permutation of bytes. RC4 has been used to encrypt network traffic but weaknesses have been found, including biases in the early output bytes that allow recovery of encryption keys. While simple and fast, RC4 is no longer considered secure for many applications.
DES (Data Encryption Standard) pressentation
This document discusses data encryption methods. It defines encryption as hiding information so it can only be accessed by those with the key. There are two main types: symmetric encryption uses one key, while asymmetric encryption uses two different but related keys. Encryption works by scrambling data using techniques like transposition, which rearranges the order, and substitution, which replaces parts with other values. The document specifically describes the Data Encryption Standard (DES) algorithm and the public key cryptosystem, which introduced the innovative approach of using different keys for encryption and decryption.
Hash Function
This document discusses message authentication techniques including message encryption, message authentication codes (MACs), and hash functions. It describes how each technique can be used to authenticate messages and protect against various security threats. It also covers how symmetric and asymmetric encryption can provide authentication when used with MACs or digital signatures. Specific MAC and hash functions are examined like HMAC, SHA-1, and SHA-2. X.509 is introduced as a standard for digital certificates.
Message Authentication Code & HMAC
This document discusses message authentication codes (MACs). It explains that MACs use a shared symmetric key to authenticate messages, ensuring integrity and validating the sender. The document outlines the MAC generation and verification process, and notes that MACs provide authentication but not encryption. It then describes HMAC specifically, which applies a cryptographic hash function to the message and key to generate the MAC. The key steps of the HMAC process are detailed.
Blow fish final ppt
This document discusses the design and implementation of the Blowfish encryption algorithm using Verilog HDL. Blowfish is a symmetric block cipher that uses a variable-length key from 32 to 448 bits, making it suitable for securing data. The algorithm consists of two parts - key expansion and a round structure involving 16 rounds of operations. The authors implemented Blowfish using Verilog HDL on a Xilinx FPGA for applications requiring encryption like IoT devices. Their design achieved high-speed encryption of up to 4 bits per clock cycle and operated at a maximum frequency of 50MHz.
Design and Simulation Triple-DES
The document discusses the simulation of a Triple Data Encryption Standard (Triple DES) circuit using VHDL. It provides background on Triple DES, describes the design and structure of the Triple DES circuit in VHDL, and presents the results of testing the encryption and decryption functions of the circuit through simulation. Testing showed the circuit correctly performed encryption and decryption on input data using the Triple DES algorithm. The design utilized some FPGA resources but would require a clock generator and RAM for implementation on an actual FPGA board.
Cryptographic Algorithms: DES and RSA
A very clear presentation on Crytographic Alogotithms DES and RSA with basic concepts of cryptography. This presented by students of Techno India, Salt Lake.
CS6701 CRYPTOGRAPHY AND NETWORK SECURITY
HASH FUNCTIONS AND DIGITAL SIGNATURES
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC –MD5 – SHA – HMAC – CMAC – Digital signature and authentication protocols – DSS – EI Gamal – Schnorr.
Elliptic curve cryptography
Elliptic Curve Cryptography was presented by Ajithkumar Vyasarao. He began with an introduction to ECC, noting its advantages over RSA like smaller key sizes providing equal security. He described how ECC works using elliptic curves over real numbers and finite fields. He demonstrated point addition and scalar multiplication on curves. ECC can be used for applications like smart cards and mobile devices. For key exchange, Alice and Bob can agree on a starting point and generate secret keys by multiplying a private value with the shared point. ECC provides security through the difficulty of solving the elliptic curve discrete logarithm problem.
Hash Function
A hash function maps data of arbitrary size to a fixed size value called a hash. Common hash functions include MD5 and SHA, with MD5 producing a 128-bit hash. While hashes were once used to securely store passwords, MD5 is now considered cryptographically broken due to collisions being found in its compression function. One-way signatures allow multiple users to generate linked signatures on the same message in a verifiable chain.
AES-Advanced Encryption Standard
Advanced Encryption Standard. What is AES? Why AES? Cryptography. Working of AES. Attacks on AES. Full working description of AES.
What's hot (20)
Viewers also liked
The SHA Hashing Algorithm
An introduction to the SHA Hashing Algorithm. The origins of SHA are explained, along with the family taxonomy of SHA message digest functions. We also cover their uses in cryptography. http://boblandstrom.com
Secure Hash Algorithm (SHA-512)
Secure Hash Algorithm 512 (SHA-512) description with figure and equation according to the book of Behrauz A. Forouzan and internet searching.
Secure hashing algorithm
This document discusses secure hashing algorithms used for authentication rather than encryption. It provides an overview of the requirements for authentication including preventing masquerading, content modification, sequence modification, and timing modification. It then describes the basic theory behind hashing including producing a message digest, ensuring it is computationally infeasible to find two messages with the same digest, and being unable to recreate a message from its digest. Finally, it details the framework of the SHA-1 hashing algorithm including preprocessing the message, initializing buffers, processing the message in blocks, and outputting the final digest.
MD5Algorithm
MD5 & Hash Encryption provides an overview of MD5 and hash encryption algorithms. It discusses the purpose and examples of MD5, how the MD5 algorithm works, potential security risks like collisions, and practical applications through code. It also covers how difficult MD5 is to crack through brute force, though flaws in the algorithm allow for exploits, and discusses how MD5 is used for digital signatures, certificates, and one-way encryption storage.
The MD5 hashing algorithm
An introduction to the MD5 Hashing Algorithm and its importance in the data center as an essential component of cryptography. http://boblandstrom.com
Md5
This document summarizes the MD5 algorithm and proposes methods to strengthen it against cracking. It analyzes the MD5 algorithm and common cracking approaches. It then proposes several measures to improve MD5 security, including increasing password complexity, using secondary encoding, and increasing the length of the MD5 hash value through concatenation to reduce collision probability. It includes a demonstration program that implements one proposed method of increasing hash length through multiple encodings and concatenation.
Fungsi Hash & Algoritma SHA-256 - Presentation
Dokumen tersebut membahas tentang fungsi hash dan algoritma SHA-256. Fungsi hash merupakan fungsi yang mengubah pesan dengan panjang sembarang menjadi pesan ringkas dengan panjang tetap. Algoritma SHA-256 merupakan salah satu varian dari SHA yang menghasilkan nilai hash sepanjang 256 bit.
Mémoire HEC Entrepreneurs - L'Entrepreneuriat dans le Sport
Mémoire de fin d'études - HEC Entrepreneurs : "L'Entrepreneuriat dans le Sport"
Question de recherche : "Comment les startups sportives permettent-elles de professionnaliser l'industrie du sport business français ?"
Blandine Freté & Caroline Laroche, 1er septembre 2014
Tuteur : Florian Grill
Sponges
The document discusses the characteristics of sponges. It notes that sponges are the simplest of animals, with no organs or senses. However, they are classified as animals because they are multicellular, their cells have specialized functions and lack cell walls, they are heterotrophic, and their larvae are motile. The document describes sponges' anatomy, noting they are filter feeders that draw water through pores using flagella. It also discusses sponge spicules, which form their skeleton, and their reproduction, which can occur asexually and sexually through budding.
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
The document discusses hash functions and the MD5 algorithm. It explains that a hash function maps inputs of arbitrary size to outputs of a fixed size, and that it is virtually impossible to derive the input given only the hash output. The document then provides a detailed overview of how the MD5 algorithm works, including converting the input to binary, padding it to a multiple of 512 bits, breaking it into 512-bit blocks, assigning initialization values, and performing 64 rounds of logical operations on each block that combines it with the output of the previous block.
Secure Hash Algorithm
Secure Hash Algorithm (SHA) was developed by NIST and NSA to hash messages into fixed-length message digests. SHA has multiple versions including SHA-1, SHA-2, and SHA-3. SHA-1 produces a 160-bit message digest and works by padding the input message, appending the length, dividing into blocks, initializing variables, and processing blocks through 80 rounds of operations to output the digest. SHA-512 is closely modeled after SHA-1 but produces a 512-bit digest and uses 1024-bit blocks.
Routing algorithm
The document discusses and compares different routing algorithms:
1. It classifies routing protocols as either link state or distance vector, and describes how each type works. Link state algorithms use flooding to share link information, while distance vector algorithms iteratively calculate the best paths.
2. It explains that distance vector algorithms can have issues with counting to infinity and routing loops. Techniques like poison reverse are used to address this.
3. It notes that link state algorithms have faster convergence but require more overhead, while distance vector algorithms are simpler but can be slower to converge.
4. Hierarchical routing is introduced as a way to scale routing by organizing routers into autonomous systems (AS) with inter and intra-
Viewers also liked (12)
Mémoire HEC Entrepreneurs - L'Entrepreneuriat dans le Sport
Mémoire HEC Entrepreneurs - L'Entrepreneuriat dans le Sport
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Similar to SHA-3, Keccak & Sponge function
Chapter_3_Networking.ppt
This document summarizes key concepts in networking and internetworking including switching, routing using IP, and end-to-end protocols like UDP and TCP. It discusses building blocks like nodes, links, switches and routing. Specific topics covered include switched networks, datagram switching, addressing and routing, inter-process communication, multiplexing, statistical multiplexing, addressing issues, protocol layers, encapsulation, and the OSI model. TCP and IP are described in detail including segment and header formats.
Chapter_3_Networking.ppt
This document summarizes key concepts in networking and internetworking including switching, routing using IP, and end-to-end protocols like UDP and TCP. It discusses building blocks like nodes, links, switches and routing. Specific topics covered include switched networks, datagram switching, addressing and routing, inter-process communication, multiplexing, statistical multiplexing, addressing issues, protocol layers, encapsulation, and the OSI model. TCP and IP are described in detail including segment and header formats.
Content addressable network(can)
This document summarizes Content Addressable Network (CAN), a structured peer-to-peer network. CAN partitions a virtual d-dimensional space among nodes, with each node responsible for a zone. It allows keys to be mapped to values by hashing keys to points in the space. New nodes join by contacting an existing node and splitting its zone. Routing is done by forwarding requests to the node responsible for the zone containing the destination point. Zones are reassigned if neighboring nodes fail to send periodic alive messages. CAN scales well as routing path length increases slowly with number of nodes. Future work could involve increasing dimensions, caching, and zone overloading.
Faster Content Distribution with Content Addressable NDN Repository
This document describes carepo, a content addressable repository for Named Data Networking (NDN) that improves content distribution. Carepo identifies identical content that appears under different names by computing hashes of content chunks. It maintains a hash index at repositories and publishes hash lists from producers. This allows consumers to find identical chunks cached on nearby nodes, reducing download times by up to 38% compared to NDN in tests with Linux ISO files. Carepo increases publishing time by around 4x to generate chunk hashes and indexes but this is a one-time cost outweighed by faster distribution to multiple consumers.
Seattle Scalability Meetup 6-26-13
Amdahl's Law Redux - Using Concurix's Node.js Analytics Tools
Presentation by Alexander Gounares to Seattle Scalability Meetup Group on June 26, 2013
Majorppt
The document discusses wireless sensor networks and describes a project using MICAz motes. It covers:
1. The characteristics and applications of wireless sensor networks, including sensing data and forwarding it through multi-hop routing.
2. Security threats in sensor networks like eavesdropping and denial of service attacks, and solutions like frequency hopping and encryption.
3. The project uses MICAz motes running TinyOS to sense temperature data and forward it securely through the network to a base station. Skipjack encryption and Diffie-Hellman key exchange provide security.
Networks (Distributed computing)
This document discusses data networking and client-server communication. It covers distributed systems, network protocols, the OSI reference model, networking terminology like LANs and topologies, transmission networks, Ethernet, connecting to the internet, transport protocols like TCP and UDP, and IP addressing. Key concepts include layered network protocols, circuit-switched vs packet-switched networks, and connection-oriented vs connectionless protocols.
Modern software design in Big data era
This document discusses key concepts for modern software design in big data systems. It covers topics like data structures, algorithms, distributed systems, and performance optimization. Specifically, it discusses techniques like caching, compression, locality, immutability, and consistency models. It provides examples from systems like MapReduce, Hadoop, Spark, Cassandra and Google. The goal is to understand principles for designing scalable, fault-tolerant and high performance big data systems.
Moein
The document discusses various topics related to security in e-commerce including cryptography mechanisms like symmetric and asymmetric encryption, hashing functions, and encryption algorithms like DES, AES, and RSA. It also covers security protocols like SSL/TLS, SET, S/MIME, and SSH. IPSec and its components AH, ESP and IKE are explained. The IKE phases including phase 1 for mutual authentication and phase 2 for establishing session keys are summarized.
group11_DNAA:protocol stack and addressing
The document discusses the OSI model protocol stack and addressing. It describes the functions of each layer of the OSI model from the physical layer to the transport layer. The physical layer deals with physical transmission and encoding of data. The data link layer handles framing, addressing, error detection and flow control. The network layer is responsible for path determination and packet forwarding between hosts. The transport layer ensures reliable end-to-end delivery of data through functions like port addressing, segmentation/reassembly, connection control, flow control and error control.
PF_DIRECT@TMA12
This document proposes a new software framework called PF_DIRECT for high performance traffic generation on commodity multi-core systems. PF_DIRECT is a Linux socket that leverages multi-core CPUs and multi-queue NICs to decouple traffic generation and transmission. It allows a single thread to generate non-trivial traffic close to wire speed. An experimental traffic generator is built on top of PF_DIRECT that uses multiple kernel threads to transmit packets through different hardware queues in parallel. Experimental results show the generator can achieve throughput over 12.8 million packets per second on a 10Gb link. Future work includes releasing the PF_DIRECT source code and implementing more complex traffic models.
Software defined network
Software defined networking (SDN) aims to decouple the network control and data planes by providing an open standard application programming interface (API). This allows for a logically centralized controller that maintains a global view of the network. The controller can programmatically configure forwarding rules on SDN switches using the API. This new architecture enables more flexible, programmable networks and has consequences for both industry and research. For industry, it promises to accelerate innovation, lower costs, and create new services. For research, it provides opportunities to develop new network programming languages and abstractions that simplify network specification and management.
Shubham chakravarty ppt_wcan
The document discusses the Wireless Controller Area Network (WCAN) protocol. WCAN is based on the Controller Area Network (CAN) protocol but makes it wireless. It uses a token frame scheme to transmit messages in a ring network topology. Simulation results showed that WCAN can achieve higher throughput and packet delivery ratios than IEEE 802.11 in some scenarios, especially when the packet transmission rate is increased. WCAN is suitable for real-time industrial automation and vehicle applications where microcontrollers need to wirelessly communicate with each other.
Ch12
The document summarizes several hash algorithms including MD5, SHA-1, and RIPEMD-160. It describes the design and security of each algorithm. It also discusses HMAC, which uses a hash function to provide message authentication by including a key along with the message.
Bluetooth mobileip
This document discusses Bluetooth and Mobile IP. It provides an overview of Bluetooth including its consortium, scenarios, specifications, and protocol architecture. It then discusses Mobile IP and the motivation for its development to allow for IP mobility as nodes change networks while maintaining ongoing connections and their IP address. The key requirement for Mobile IP is transparency, allowing mobile devices to keep their IP address and continue communication after changing networks.
Computer network
This document discusses IP addressing and routing in computer networks. It covers MAC addresses, IP addresses (including IPv4 and IPv6), IP address classes (A, B, C, D, E), network masks, loopback addresses, routing algorithms like flooding, distance vector, and link state. It also defines terms like routers, gateways, ping, bandwidth, transmission time, propagation delay, routing tables, and shortest path trees. The goal of computer networks is to provide fast, accurate, adequate, and secure communication between systems.
DISTIBUTED OPERATING SYSTEM
LAN Technologies
Ethernet and IEEE Token Ring
IEEE Token Ring
Message transfer in OSI reference Model
Example of Message Transfer in the OSI Model
Application Layer Protocols.
Stefano Giordano
The document discusses network intrusion detection and anomaly detection from a research perspective. It describes using network processors to develop a device that can perform high-speed packet capturing, timestamping, and processing. The device is used to build a traffic measurements system that can analyze traffic at wire speed and online to accurately characterize network traffic.
Stefano Giordano
1) The document discusses network intrusion detection systems and anomaly detection from a research perspective. It focuses on developing a device that can perform high-speed packet capturing and timestamping for traffic analysis.
2) The proposed device uses a network processor based architecture with an Intel IXP network processor to perform wire-speed packet processing and classification. It timestamps packets and groups them into "batch frames" to send to a receiving PC for further analysis.
3) The system aims to provide accurate, high-speed traffic measurements and analysis for research into network security and anomaly detection. It seeks to classify network traffic in real-time and detect network intrusions and anomalies.
keccak.ppt that is about introduction and basics
The document discusses the SHA-3 algorithm, which uses the Keccak algorithm to hash inputs into fixed-length outputs. SHA-3 was developed through a public competition after vulnerabilities were found in earlier hash functions like SHA-1 and SHA-2. It uses a sponge construction and Keccak-f permutation to absorb data into a state and squeeze out the hashed output. SHA-3 supports four hash lengths and aims to provide security against cryptographic attacks.
Similar to SHA-3, Keccak & Sponge function (20)
Faster Content Distribution with Content Addressable NDN Repository
Faster Content Distribution with Content Addressable NDN Repository
Recently uploaded
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
ここ3000字までしか入らないけどタイトルの方がたくさん文字入ると思います。
June Patch Tuesday
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Essentials of Automations: The Art of Triggers and Actions in FME
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Fueling AI with Great Data with Airbyte Webinar
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Mind map of terminologies used in context of Generative AI
Mind map of common terms used in context of Generative AI.
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
20240609 QFM020 Irresponsible AI Reading List May 2024
Everything I found interesting about the irresponsible use of machine intelligence in May 2024
Generating privacy-protected synthetic data using Secludy and Milvus
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Taking AI to the Next Level in Manufacturing.pdf
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
20240605 QFM017 Machine Intelligence Reading List May 2024
Everything I found interesting about machines behaving intelligently during May 2024
Infrastructure Challenges in Scaling RAG with Custom AI models
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
Imagine a world where machines not only perform tasks but also learn, adapt, and make decisions. This is the promise of Artificial Intelligence (AI), a technology that's not just enhancing our lives but revolutionizing entire industries.
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
National Security Agency - NSA mobile device best practices
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
HCL Notes and Domino License Cost Reduction in the World of DLAU
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
20240607 QFM018 Elixir Reading List May 2024
Everything I found interesting about the Elixir programming ecosystem in May 2024
Recently uploaded (20)
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
みなさんこんにちはこれ何文字まで入るの？40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの？えこ...
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
Mind map of terminologies used in context of Generative AI
Mind map of terminologies used in context of Generative AI
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for Life Science to increase LLM accuracy
20240609 QFM020 Irresponsible AI Reading List May 2024
20240609 QFM020 Irresponsible AI Reading List May 2024
Generating privacy-protected synthetic data using Secludy and Milvus
Generating privacy-protected synthetic data using Secludy and Milvus
20240605 QFM017 Machine Intelligence Reading List May 2024
20240605 QFM017 Machine Intelligence Reading List May 2024
Infrastructure Challenges in Scaling RAG with Custom AI models
Infrastructure Challenges in Scaling RAG with Custom AI models
Driving Business Innovation: Latest Generative AI Advancements & Success Story
Driving Business Innovation: Latest Generative AI Advancements & Success Story
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
AI 101: An Introduction to the Basics and Impact of Artificial Intelligence
Monitoring and Managing Anomaly Detection on OpenShift.pdf
Monitoring and Managing Anomaly Detection on OpenShift.pdf
National Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practices
HCL Notes and Domino License Cost Reduction in the World of DLAU
HCL Notes and Domino License Cost Reduction in the World of DLAU
SHA-3, Keccak & Sponge function
- 2. Input message Digest h : {0, 1}* {0, 1}n
- 3. A cryptographic hash function is an algorithm that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that any change to the data will change the hash value. The data to be encoded are often called the "message," and the hash value is sometimes called the message digest or simply digest. MD5 MD = 128 (Ron Rivest, 1992) SHA-1 MD = 160 (NSA, NIST, 1995) SHA-2 MD = 224/256/384/512 (NSA, NIST, 2001) SHA-3 MD = arbitrary (Bertoni, Daemen, Peeters, Van Assche, NIST, 20
- 4. • Cryptographic hash function, SHA family • Selected on October 2012 as the winner of the NIST hash function competition • Not meant to replace SHA-2 • Based on the sponge construction
- 5. More general than a hash function: arbitrary-length output Calls a b-bit permutation f, with b = r + c r bits of rate c bits of capacity
- 8. The duplex construction allows the alternation of input and output blocks at the same rate as the sponge construction, like a full-duplex communication
- 9. • High level of parallelism • Flexibility: bit-interleaving • Software: competitive on wide range of CPU (also implem. for CUDA) • Dedicated hardware: very competitive • Suited for protection against side-channel attack • Faster than SHA-2 on all modern PC (12.5cpb on C2D)
- 10. • http://keccak.noekeon.org/tune.html If an attacker has access to one billion computers, each performing one billion evaluations of Keccak-f per second, it would take about 1.6×1061 years (1.1×1051 times the estimated age of the universe) to evaluate the permutation 2288 times KECCAK-f[r+c] KECCAK-f[1024+576] KECCAK-f[1600]
- 12. In the pseudo-code above, S denotes the state as an array of lanes. The padded message P is organised as an array of blocks Pi, themselves organized as arrays of lanes. The || operator denotes the usual byte string concatenation.
- 16. • Currently best attack on KECCAK: 4 rounds • Sufficient nr. of rounds for security claim on KECCAK: 13 rounds • KECCAK has 24 rounds (complexity 215xx)
- 17. • http://en.wikipedia.org/wiki/SHA-3 • http://sponge.noekeon.org/ • http://keccak.noekeon.org/specs_summary.html • http://csrc.nist.gov/groups/ST/hash/sha- 3/documents/Keccak-slides-at-NIST.pdf • http://celan.informatik.uni- oldenburg.de/kryptos/info/keccak/overview/ ...