Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"hash function"”.

  1. Security proofs for the MD6 hash function mode of operation

    … cryptanalytic attacks on several commonly-used hash functions, such as MD4, MD5, SHA-0, and SHA1 [13, 38]. These culminated with the celebrated work of Wang, Yin, and Yu from 2005, which demonstrated relatively efficient methods for finding collisions in the SHA-1 hash function [37]. Although …

    mit Repository record for Security proofs for the MD6 hash function mode of operation (opens in a new tab)

  2. Design and analysis of hash functions

    A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is known as a hash function. For the last two decades, many types of hash functions have been defined but, the most widely used in many of the cryptographic applications currently are hash functions …

    vu-aus Repository record for Design and analysis of hash functions (opens in a new tab)

  3. Perfect hashing and related problems

    … structure that supports these operations is a hash table. On a hash table, a basic operation takes 𝑂(1) time in the average case and 𝑂(𝑛) time in the worst case, where n is the number of words in the dictionary. While an ordinary hash function maps the words in a dictionary to a hash table with …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  4. Hardware Evaluation of SHA-3 Candidates

    Cryptographic hash functions are used extensively in information security, most notably in digital authentication and data integrity verification. Their performance is an important factor of the overall performance of a secure system. In 2005, some groups of cryptanalysts were making increasingly …

    vt Repository record for Hardware Evaluation of SHA-3 Candidates (opens in a new tab)

  5. Certifying checksum-based logging in the RapidFSCQ crash-safe filesystem

    … of modeling the probabilistic guarantees of a hash function. This method is then applied to the logging system underlying RapidFSCQ, a certified crash-safe filesystem, to support formally verified checksums. An evaluation of RapidFSCQ shows that it enables end-to-end verification of application …

    mit Repository record for Certifying checksum-based logging in the RapidFSCQ crash-safe filesystem (opens in a new tab)

  6. Improving the security services of the message handling systems in X.400.

    … have been found in the postulates known as the Hash-Function Rules. New Hash-Function Rules are proposed for improving the authentication logic. The newly proposed message-tokens are proved to be capable of ensuring the integrity and originality of the conveyed information and thus prevent the …

    ottawa-retro Repository record for Improving the security services of the message handling systems in X.400. (opens in a new tab)

  7. Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic

    … notion of correlation intractability, which is a hash function security property requiring that it is computationally infeasible to find pre-specified input-output correlations in the hash function. Using this methodology, we obtain various new results in cryptography, touching on areas such as …

    mit Repository record for Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic (opens in a new tab)

  8. Scoop : an adaptive indexing scheme for stored data in sensor networks

    … locally, at the node that produced it, or is hashed to some location in the network using a predefined uniform hash function. These two approaches are at the extremes of a trade-off between storage and query costs. In the former case, the costs of storing data ate low, since no transmissions …

    mit Repository record for Scoop : an adaptive indexing scheme for stored data in sensor networks (opens in a new tab)

  9. STRENGTH EVALUATION OF CRYPTOGRAPHIC PRIMITIVES TO LINEAR, DIFFERENTIAL AND ALGEBRAIC ATTACKS.

    … cases. Particular focus has been paid to SHA1 hash function and on the stream cipher E0, used in the Bluetooth protocol. Samely, differential and linear cryptanalysis are applied to several symmetric ciphers. In particular, it is shown how to develop in Python an automatic tool for searching …

    milano Repository record for STRENGTH EVALUATION OF CRYPTOGRAPHIC PRIMITIVES TO LINEAR, DIFFERENTIAL AND ALGEBRAIC ATTACKS. (opens in a new tab)

  10. IoT data encryption algorithm for security

    … The technique proposed in this research is using Hash function and encryption method to protect the data. To show the working of the encryption, a simulation is performed. The simulation used is a MATLAB coding. By inserting the number of bit and size of the data with random plain text, the system …

    uthm Repository record for IoT data encryption algorithm for security (opens in a new tab)

  11. Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison

    … oblivious transfer and a collision resistant hash function. We formally prove that the PET protocol and the PGT protocol provide computational security. In this research, we developed our protocol for PET and run experiments to test it. The results provide evidence of efficiency of our …

    calgary Repository record for Efficient Non-Interactive Secure Two-Party Computation for Equality and Comparison (opens in a new tab)

  12. Single-trace template attacks on permutation-based cryptography

    … on target intermediate bytes in the SHA3-512 hash function implemented on an 8-bit device, which I combined with a three-layer enumeration technique for error correction to recover all the input values of this hash function from a single trace recording. To demonstrate an alternative …

    cambridge Repository record for Single-trace template attacks on permutation-based cryptography (opens in a new tab)

  13. Binární znaménkové reprezentace celých čísel v kryptoanalýze hashovacích funkcí

    … Representations of Integers in Cryptanalysis of Hash Functions Author: Jiří Vábek Department: Department of Algebra Supervisor: doc. RNDr. Jiří Tůma, DrSc., Department of Algebra Abstract: The work summarizes two main papers, A New Type of 2-block Colli- sions in MD5 and On the Number of Binary …

    charles-prague Repository record for Binární znaménkové reprezentace celých čísel v kryptoanalýze hashovacích funkcí (opens in a new tab)

  14. Attacks on the Fiat-Shamir paradigm and program obfuscation

    … scheme, with the value of some deterministic hash function evaluated on the first-round message (sent by the prover) and on the message to be signed.

    mit Repository record for Attacks on the Fiat-Shamir paradigm and program obfuscation (opens in a new tab)

  15. An Investigation of Methods to Improve Area and Performance of Hardware Implementations of a Lattice Based Cryptosystem

    … we investigate replacing the large SHAKE XOF (hash) function with a lightweight Trivium based PRNG, which reduces the area by 32% and improves energy efficiency by 30% for the pipelined encryption implementation, and which could be considered for future cipher specifications.

    vt Repository record for An Investigation of Methods to Improve Area and Performance of Hardware Implementations of a Lattice Based Cryptosystem (opens in a new tab)

  16. A Suite of Fast and Efficient Cryptographic Mechanisms for Wireless Ultra-Low Power Device Networks

    … mechanisms, including a cryptographic hash function, a construction of one-way hash chains, a dynamic access control, and a secure data transmission protocol to offer affordable, efficient but necessary security protection to ultra-low power devices to meet their network security …

    regina Repository record for A Suite of Fast and Efficient Cryptographic Mechanisms for Wireless Ultra-Low Power Device Networks (opens in a new tab)

  17. Spinal codes

    … is the sequential application of a pseudo-random hash function to the message bits, to produce a sequence of coded symbols for transmission. This encoding ensures that two input messages that differ in even one bit lead to very different coded sequences after the point at which they differ, …

    mit Repository record for Spinal codes (opens in a new tab)

  18. Associative Pattern Recognition for Biological Regulation Data

    … transcription factors, histone modifications and functional labels using heterogeneous data sources (numeric, sequences, time series data and textual labels). </p> <p>In protein-DNA associative pattern recognition, we introduce an efficient algorithm for affinity test by searching for …

    syracuse-diss Repository record for Associative Pattern Recognition for Biological Regulation Data (opens in a new tab)

  19. Cryptographic coprocessors for embedded systems

    … based digital signature algorithm is developed. Hash functions are also an important component of a cryptographic system. The FPGA implementation of recent hash function designs from the SHA-3 competition are discussed and a fair comparison methodology for hash functions presented. Many …

    cork Repository record for Cryptographic coprocessors for embedded systems (opens in a new tab)

  20. Secure Discovery of Genetic Relatives across Large-Scale and Distributed Genomic Datasets

    … detection through a novel locality-sensitive hashing approach. We assign individuals who are likely to be related together into buckets and then test relationships only between individuals in matching buckets across parties. To this end, we construct an effective hash function that captures …

    mit Repository record for Secure Discovery of Genetic Relatives across Large-Scale and Distributed Genomic Datasets (opens in a new tab)

Page 1 of 2