Results 271 to 280 of about 250,620 (292)
Some of the next articles are maybe not open access.
Constructing Compression Functions
2021We have seen that cryptographic hash functions that can process arbitrarily long inputs can be built from fixed-input-length compression functions via the Merkle–Damgard transformation (Chapter 13).
Arno Mittelbach, Marc Fischlin
openaire +1 more source
Engineering Compressed Static Functions
2018 Data Compression Conference, 2018Recent advances in the compact representation of static functions (with constant access time) have made it possible to fully exploit constructions based on random linear system. Such constructions, albeit theoretically appealing, were previously too slow to be usable.
Genuzio, Marco, Vigna, Sebastiano
openaire +1 more source
Building indifferentiable compression functions from the PGV compression functions
Designs, Codes and Cryptography, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gauravaram, Praveen +2 more
openaire +3 more sources
Functional programs as compressed data
Higher-Order and Symbolic Computation, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kobayashi, Naoki +3 more
openaire +3 more sources
Gabor function-based medical image compression
Image and Vision Computing, 1995Compression methods based on Gabor functions are implemented for simulated nuclear medicine liver images with and without lesions. The performance of the compression schemes is assessed objectively by comparing the original images to the compressed/reconstructed images through calculation of the Hotelling trace, an index that has been shown to ...
M P Anderson, M H Loew, D G Brown
openaire +1 more source
Cryptanalysis of MAME compression function
2010 International Conference On Computer Design and Applications, 2010MAME is a compression function designed for hardware-oriented hash functions which can be used in applications with reduced hardware requirements and was described in CHES 2007. This paper first gives the 22, 23, 24 rounds attacks using the cryptanalysis on generalized Feistel.
null Yu Xue, null Wenling Wu
openaire +1 more source
On Distributed Compression of Linear Functions
IEEE Transactions on Information Theory, 2008We consider distributed compression of a pair of Gaussian sources in which the goal is to reproduce a linear function of the sources at the decoder. It has recently been noted that lattice codes can provide improved compression rates for this problem compared to conventional, unstructured codes.
openaire +1 more source
Aggregation Rate for Compressible Functions
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017One of the most fundamental tasks in sensor networks is the computation of a (compressible) aggregation function of the input measurements. What rate of computation can be maintained, by properly choosing the aggregation tree, the TDMA schedule of the tree edges, and the transmission powers? We show here that the optimal rate is effectively a constant.
Magnús M. Halldórsson, Tigran Tonoyan
openaire +1 more source
Compressively sampling the plenacoustic function
SPIE Proceedings, 2011Directly measuring the full set of acoustic impulse responses within a room would require an unreasonably large number of measurements. Considering that the acoustic wavefield is sparse in some dictionaries, Compressed Sensing allows the recovery of the full wavefield with a reduced set of measurements, but raises challenging computational and memory
Mignot, R., Chardon, G., Daudet, L.
openaire +2 more sources