English
Related papers

Related papers: Colliding Message Pairs for 23 and 24-step SHA-512

200 papers

Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf…

Cryptography and Security · Computer Science 2017-07-11 Joel Alwen , Jeremiah Blocki , Krzysztof Pietrzak

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2019-10-21 Fabian Steiner , Emna Ben Yacoub , Balazs Matuz , Gianluigi Liva , Alexandre Graell i Amat

The message complexity of a distributed algorithm is the total number of messages sent by all nodes over the course of the algorithm. This paper studies the message complexity of distributed algorithms for fundamental graph optimization…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-28 Fabien Dufoulon , Shreyas Pai , Gopal Pandurangan , Sriram V. Pemmaraju , Peter Robinson

We consider protection problems in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered…

Optimization and Control · Mathematics 2013-05-01 Marzieh Parandehgheibi , Hyang-Won Lee , Eytan Modiano

In this paper we design network coding schemes for Differential Chaos Shift Keying (DCSK) modulation. In this work, non-coherent chaos-based communication system is used due to its simplicity and robustness to multipath propagation effects,…

Information Theory · Computer Science 2015-05-13 Georges Kaddoum , Mohammed El-Hajjar

While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the…

In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the ${\bf H}^H{\bf H}$ matrix become…

Information Theory · Computer Science 2014-01-13 T. Lakshmi Narasimhan , A. Chockalingam

Strongly conflict-avoiding codes (SCACs) are employed in a slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed…

Information Theory · Computer Science 2016-05-17 Yijin Zhang , Yuan-Hsun Lo , Wing Shing Wong

This paper suggests achieving diversity gains while utilizing low-denisty parity check (LDPC) codes in molecular communications. Intersymbol interference (ISI) causes a significant disadvantage in error performance for molecular…

Signal Processing · Electrical Eng. & Systems 2024-12-06 Alpar Türkoğlu , Berk Karabacakoğlu , Ali Emre Pusane

Semantic caching has emerged as a pivotal technique for scaling LLM applications, widely adopted by major providers including AWS and Microsoft. By utilizing semantic embedding vectors as cache keys, this mechanism effectively minimizes…

Cryptography and Security · Computer Science 2026-02-02 Zhixiang Zhang , Zesen Liu , Yuchong Xie , Quanfeng Huang , Dongdong She

This work presents a new multi-chemical experimental platform for molecular communication where the transmitter can release different chemicals. This platform is designed to be inexpensive and accessible, and it can be expanded to simulate…

Emerging Technologies · Computer Science 2017-04-18 Nariman Farsad , David Pan , Andrea Goldsmith

In prior works, stochastic dual coordinate ascent (SDCA) has been parallelized in a multi-core environment where the cores communicate through shared memory, or in a multi-processor distributed memory environment where the processors…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-03 Soumitra Pal , Tingyang Xu , Tianbao Yang , Sanguthevar Rajasekaran , Jinbo Bi

In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

Computational Complexity · Computer Science 2017-05-11 Till Fluschnik , Marco Morik , Manuel Sorge

SEPAR is a lightweight cryptographic algorithm, designed to implement on resource-constrained devices especially those employed in IoT environments. Meanwhile, the mixed structure design of cipher leads to speed improvement while…

Cryptography and Security · Computer Science 2021-06-25 Arsalan Vahi , Mirkamal Mirnia

State-of-the-art convolutional neural network models for object detection and image classification are vulnerable to physically realizable adversarial perturbations, such as patch attacks. Existing defenses have focused, implicitly or…

Computer Vision and Pattern Recognition · Computer Science 2025-06-25 Mauricio Byrd Victorica , György Dán , Henrik Sandberg

The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of…

Data Structures and Algorithms · Computer Science 2015-04-22 Fedor V. Fomin , Petr A. Golovach , Nikolay Karpov , Alexander S. Kulikov

In this paper, we propose an algorithm that targets contamination and eavesdropping adversaries. We consider the case when the number of independent packets available to the eavesdropper is less than the multicast capacity of the network.…

Cryptography and Security · Computer Science 2008-05-16 Yejun Zhou , Hui Li , Jianfeng Ma

SSH is an important protocol for secure remote shell access to servers on the Internet. At USENIX 2024, B\"aumer et al. presented the Terrapin attack on SSH, which relies on the attacker injecting optional messages during the key exchange.…

Cryptography and Security · Computer Science 2025-09-16 Fabian Bäumer , Marcel Maehren , Marcus Brinkmann , Jörg Schwenk

This paper extends the Single Packet Header Binary Image (SPHBI) intrusion detection methodology from IoT to Modbus TCP, evaluating five approaches spanning a gradient of protocol depth on the CIC Modbus 2023 dataset (11.4 million packets,…

Cryptography and Security · Computer Science 2026-05-08 Aamir Omar
‹ Prev 1 8 9 10 Next ›