Strongly universal string hashing is fast

We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees. Moreover, conventional wisdom is that hash functions with fewer multiplications are faster. Yet we find that they may fail to be faster due to operation pipelining. We present experimental results on several processors including low-powered processors. Our tests include hash functions designed for processors with the Carry-Less Multiplication (CLMUL) instruction set. We also prove, using accessible proofs, the strong universality of our families.Comment: Software is available at http://code.google.com/p/variablelengthstringhashing/ and https://github.com/lemire/StronglyUniversalStringHashin

Private Randomness Agreement and its Application in Quantum Key Distribution Networks

We define a variation on the well-known problem of private message transmission. This new problem called private randomness agreement (PRA) gives two participants access to a public, authenticated channel alongside the main channels, and the 'message' is not fixed a priori. Instead, the participants aim to agree on a random string completely unknown to a computationally unbounded adversary. We define privacy and reliability, and show that PRA cannot be solved in a single round. We then show that it can be solved in three rounds, albeit with exponential cost, and give an efficient four-round protocol based on polynomial evaluation.Comment: 6 page

Faster 64-bit universal hashing using carry-less multiplications

Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH). We compare this new family with what might be the fastest almost universal family on x64 processors (VHASH). We find that CLHASH is at least 60% faster. We also compare CLHASH with a popular hash function designed for speed (Google's CityHash). We find that CLHASH is 40% faster than CityHash on inputs larger than 64 bytes and just as fast otherwise

Regular and almost universal hashing: an efficient implementation

Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. However, universality fails to ensure that all hash functions are well behaved. We further require regularity: when picking data objects at random they should have a low probability of having the same hash value, for any fixed hash function. We present the efficient implementation of a family of non-cryptographic hash functions (PM+) offering good running times, good memory usage as well as distinguishing theoretical guarantees: almost universality and component-wise regularity. On a variety of platforms, our implementations are comparable to the state of the art in performance. On recent Intel processors, PM+ achieves a speed of 4.7 bytes per cycle for 32-bit outputs and 3.3 bytes per cycle for 64-bit outputs. We review vectorization through SIMD instructions (e.g., AVX2) and optimizations for superscalar execution.Comment: accepted for publication in Software: Practice and Experience in September 201

A Hybrid Quantum Random Number Generation Methodology to Insure Secure Key

In the world of computation and digital communications the digital world is currently lacking in ‘security.\u27 Yes, security is a feature that can never be attained one hundred percent. However, to ensure secure data we can use huge numbers and large cryptographic keys in combination with a statistical algorithm so that deceiving or decryption of information would become very difficult. The question then becomes what if someone reaches a level in computational speed like none other with the support of advanced chip technology and cracks all the available mathematical algorithms built in combination with the available cryptographic keys? Then the world of digital computation, which makes us feel secure, becomes at risk. Recent research and achievements in advanced technology, especially in Quantum Computation and Encryption, are ringing danger bells towards conventional computational security methodologies. In this paper, I will discuss current security trends, advancements in quantum computation and traditional computation security methods that feel insecure and discuss a new methodology that uses the spin rotation of photons to add the power of quantum mechanics to classical encryption algorithms to insure a balanced key generation

Achieving Energy Efficiency on Networking Systems with Optimization Algorithms and Compressed Data Structures

To cope with the increasing quantity, capacity and energy consumption of transmission and routing equipment in the Internet, energy efficiency of communication networks has attracted more and more attention from researchers around the world. In this dissertation, we proposed three methodologies to achieve energy efficiency on networking devices: the NP-complete problems and heuristics, the compressed data structures, and the combination of the first two methods. We first consider the problem of achieving energy efficiency in Data Center Networks (DCN). We generalize the energy efficiency networking problem in data centers as optimal flow assignment problems, which is NP-complete, and then propose a heuristic called CARPO, a correlation-aware power optimization algorithm, that dynamically consolidate traffic flows onto a small set of links and switches in a DCN and then shut down unused network devices for power savings. We then achieve energy efficiency on Internet routers by using the compressive data structure. A novel data structure called the Probabilistic Bloom Filter (PBF), which extends the classical bloom filter into the probabilistic direction, so that it can effectively identify heavy hitters with a small memory foot print to reduce energy consumption of network measurement. To achieve energy efficiency on Wireless Sensor Networks (WSN), we developed one data collection protocol called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Based on the Open Vehicle Routing problem, EDAL exploits the topology requirements of Compressive Sensing (CS), then implement CS to save more energy on sensor nodes

Protocolo de comprometimento com segurança incondicional baseado no canal com ruído de reordenamento de pacotes

Tese (doutorado) — Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2021.Um grande esforço de pesquisa foi envidado nos últimos 50 anos para desenvolver primitivas criptográficas incondicionalmente seguras baseadas em condições físicas, como a existência de ruído em canais de comunicação, capacidade de armazenamento limitada ou as leis da mecânica quântica. Em trabalho desenvolvido por Paolo Palmieri e Olivier Pereira, demonstrou-se que a variação no atraso sofrido por pacotes enviados através de canais de comunicação pode ser usada como uma hipótese plausível e eficaz para se obter a primitiva criptográfica incondicionalmente segura de \textit{Oblivious Transfer} contra adversários passivos. Além disso, os autores observaram que a variação do atraso implica no efeito de reordenamento dos pacotes. No presente trabalho, pavimentamos o caminho para essa possibilidade, propondo uma nova definição para canais com ruído do tipo reordenamento de pacotes. A nossa finalidade é facilitar a obtenção de medidas estatísticas e entrópicas relativas ao canal. Apresentamos diferenças chaves entre os ruídos de atraso e de reordenamento. Finalmente, propomos a primeira implementação direta de uma primitiva criptográfica de comprometimento incondicionalmente segura contra adversários maliciosos baseada no canal de reordenamento de pacotes.A lot of research effort has been deployed in the last 50 years on achieving unconditionally secure cryptographic primitives based on physical assumptions, such as noisy channels, bounded storage capacity or quantum mechanics laws. In a work of Paolo Palmieri and Olivier Pereira, it was demonstrated the variable delay of packets sent by communication channels could be used as a reasonable and an effective assumption to achieve the unconditionally secure cryptographic primitive of Oblivious Transfer against passive adversaries. Furthermore, the authors observed that variable delays implies packet reordering effect. In the present work, we pave the path into this possibility by establishing a new definition of the Packet Reordering noisy channel. Our purpose is to simplify the calculation of statistical and entropic measures. We demonstrate key differences between noises of delay and reordering. Finally, we show the first directly implemented unconditionally secure commitment scheme against malicious adversaries based onthe packet reordering noisy channel