Hasil untuk "cs.CR"

Arun Ganesh

We give a new privacy amplification analysis for truncated Poisson sampling, a Poisson sampling variant that truncates a batch if it exceeds a given maximum batch size.

Saeed Alshehhi

In the evolving landscape of IoT ecosystem, distinguishing between legitimate and compromised devices is a critical challenge. This research investigates the effectiveness of hardware performance counter (HPC)-derived signatures' uniqueness under the umbrella of a concept that we introduced as software unclonable functions (SUFs).

Ramsès Fernàndez-València

We present an oblivious transfer scheme that extends the proposal made by Barreto, Oliveira and Benits, based in isogenies supersingular elliptic curves, to the setting of principally polarized supersingular abelian surfaces.

Dima Grigoriev, Vladimir Shpilrain

We use extensions of tropical algebras as platforms for very efficient public key exchange protocols.

Irene Villa

In a recent paper, it is shown that functions of the form $L_1(x^3)+L_2(x^9)$, where $L_1$ and $L_2$ are linear, are a good source for construction of new infinite families of APN functions. In the present work we study necessary and sufficient conditions for such functions to be APN.

Sarah M. Diesburg

Is secure deletion of data still a problem?

Kaveh Bakhtiyari

Not really.

Delaram Kahrobaei, Charalambos Koupparis

The objective of this work is to survey several digital signatures proposed in the last decade using non-commutative groups and rings and propose a digital signature using non-commutative groups and analyze its security.

V. Spoorthy Ella

This paper investigates the use of quasigroups, Hadamard transforms and Number Theoretic Transforms for use in sequence randomization. This can also be used to generate hash functions for sequence encryption.

A. S. Petrov, A. D. Plotnikov

In this paper, we examine a ciphertext on the basis of using geometrical objects. Each symbol normative alphabet is determined as a point on the plane. We consider possible ways for presentation of these points.

Sandhya Rangineni

This paper presents new results on randomization using Kak's Mesh Array for matrix multiplication. These results include the periods of the longest cycles when the the array is used for scrambling and the autocorrelation function of the binary sequence obtained from the cycles.

Unal Tatar, Tolga Mataracioglu

In this paper, different steganographic methods have been analyzed and implementations of those techniques have been performed. Those methods include hiding in text, hiding in audio file, hiding in file system, and hiding in image files.

Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

Bjoern Grohmann

A new protocol for 1-2 (String) Oblivious Transfer is proposed. The protocol uses 5 rounds of message exchange.

Elena Dubrova

In this paper, a mapping between initial states of the Fibonacci and the Galois configurations of NLFSRs is established. We show how to choose initial states for two configurations so that the resulting output sequences are equivalent.

An-Ping Li

In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.

Sumanth Kumar Reddy Gangasani

This paper examines the randomness of d-sequences, which are decimal sequences to an arbitrary base. Our motivation is to check their suitability for application to cryptography, spread-spectrum systems and use as pseudorandom sequence.

Arindam Mitra

The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key.

William Perkins

This paper analyzes the performance of Kak's three stage quantum cryptographic protocol based on public key cryptography against a man-in-the-middle attack. A method for protecting against such an attack is presented using certificates distributed by a trusted third party.

Ilia Toli

We propose public-key cryptosystems with public key a system of polynomial equations, algebraic or differential, and private key a single polynomial or a small-size ideal. We set up probabilistic encryption, signature, and signcryption protocols.