Parallel implementation of the Grøstl compression function [9]
On the Indifferentiability of the Grøstl Hash Function
... hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven ...of Grøstl, a second round SHA-3 hash function candidate. Grøstl combines ...
18
Analysis of the Hash Function – Modified Grøstl
... hash function with a compression function built from two fixed, large, distinct ...of Grøstl is based on principles very different from those used in the ...of Grøstl against large ...
6
An investigation into the parallel implementation of JPEG for image compression
... The coding process removes some redundancy from the data stream by storing the symbols in fewer bits than is used in the original source. The decoding process reverses the coding by ad[r] ...
247
Parallel implementation of digital image compression based on the JPEG standard
... JPEG algorithm is divided into four tasks as shown in the task graph of figure 3.. In this task graph each node represents a processing task.[r] ...
13
Improved Collision Attacks on the Reduced-Round Grøstl Hash Function
... reduced-round Grøstl-224 and Grøstl-256 hash functions, compres- sion function, and ...the Grøstl-256 hash func- tion reduced to 5 and 6 rounds with time complexities 2 48 and 2 112 , ...
15
Index Terms— Cache Compression, Effective System-Wide Compression Ratio, Hardware Implementation, Pair Matching, Parallel Compression
... instruction. Compression can improve cache performance by increasing effective cache capacity and eliminating ...data compression units within the memory hierarchies of microprocessors in order to improve ...
7
Compression of parallel texts
... An implementation of parallel compression Throughout the design of a mechanical system to compress parallel texts, constant recourse has been made to the human model — how would a human ...
19
Parallel Sentence Compression
... our implementation of ILPbi, we slightly modified constraint 5 to take into account the negation relations: when the head of such relation are included in the compression, then their immediate dependent ...
11
Hardware Implementation of the Compression Function for Selected SHA-3 Candidates
... hardware implementation (Skein, Shabal, and ...the compression function block is a message of fixed block size (256 or 512 bits according to the algorithm) along with the initialization vector (if ...
29
Efficient Implementation of 2D DWT for Video Compression Using Bit Parallel Architecture
... video compression, fractal analysis, texture discrimination, computer graphics, and bioinformatics, ...image compression, 2-D DWT has been accepted as standard compression ...image ...
10
Design and Implementation of VLSI DHT highly Modular and Parallel Architecture for Image Compression
... 1,2 Assistant professor, Dept. of ECE, Ramananda Tirtha Engineering College, Nalgonda,Telangana, India Abstract- Discrete Hartley transform is one of the most imperative algorithms of the signal processing and ...
5
Efficient Hardware Implementation of SHA 3 Candidate Grøstl using FPGA
... hash function takes data, text or any file and generates compressed hash value of the data, called ...hash function that fulfills collision resistance, pre-image and 2 nd pre-image resistance properties ...
6
A Low-Area Unified Hardware Architecture for the AES and the Cryptographic Hash Function Grøstl
... hash function Grøstl on several Xilinx ...and Grøstl at all levels of ...and Grøstl internal states in the register file, we manage to generate all read and write addresses by means of a ...
14
GPU implementation of bitplane coding with parallel coefficient processing for high performance image compression
... irreversible 9/7 wavelet transform is employed to transform them with 5 levels of ...this implementation when using different number of threads to code an image of the ...
13
(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others (Extended Version)
... The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by ...the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash ...
20
Parallel Lossless Data Compression on the GPU
... We hope to add additional algorithms to our compression/decompression pipeline in order to make our GPU implementation bzip2-compatible. Prior to the BWT stage and after the MTF stage, bzip2 implements ...
49
Round compression for parallel matching algorithms
... Note that f is differentiable in both (−∞, 0) and (0, ∞). Additionally, it is continuous in the entire range—the left and right branch of the function meet at 0—and both the left and right derivatives at 0 are ...
46
Round compression for parallel matching algorithms
... Finally, in Line 4, LocalPhase creates a set of friends. This step is almost identical to what happens in the global algorithm. The only difference is that this time we have no upper bound on the number of heavy ...
15
Parallel Implementation of Desirability Function-Based Scalarization Approach for Multiobjective Optimization Problems
... The parallel programming actually is the assignment of duties to parallel structure and collection of the results by ...new parallel duty can be assigned, or results from the finished job can be ...
10
On FPGA-based implementations of Grøstl
... the compression function, to simulate the ShiftBytes sub- ...the compression function f and the subsequent feedback of h to the computation of the next message ...
14