Results 111 to 120 of about 23,331 (249)

OPTIMIZED REPRESENTATIONS IN CRYPTOGRAPHIC PRIMITIVES

, 2022
This work focuses on optimization of cryptographic primitives both in theory and in applications. From a theoretical point of view, it addresses the problem of speeding up the polynomial multiplication used in Post-Quantum cryptosystems such as NTRU and McEliece. In particular, the latter extensively uses Galois fields whose elements can be represented
openaire   +2 more sources

Cryptanalysis of Selected ARX-Based Block Ciphers

Vietnam Journal of Computer Science
The security of digital communication and information systems is mostly dependent on block ciphers. ARX-based ciphers are widely used due to their simplicity and efficiency.
Praveen Kumar Gundaram
doaj   +1 more source

Logic Programming with Post-Quantum Cryptographic Primitives for Smart Contract on Quantum-Secured Blockchain [PDF]

, 2021
Xin Sun, Piotr Kulicki, Mirek Sopek
openalex   +1 more source

A note on some algebraic trapdoors for block ciphers

, 2018
We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al.
Calderini, Marco
core  

Cryptographic primitives based on compact knapsack problem

Journal of Information Security and Applications
In the present paper, we extend previous results of an id scheme based on compact knapsack problem defined by one equation. We present a sound three-move id scheme based on compact knapsack problem defined by an integer matrix. We study this problem by providing attacks based on lattices.
George S. Rizos, Konstantinos A. Draziotis   +1 more
openaire   +2 more sources

The Modification of the Quantum-Resistant AJPS-1 Cryptographic Primitive

, 2023
Dariya Yadukha
openalex   +2 more sources

Continuous variable controlled quantum dialogue and secure multiparty quantum computation

, 2019
A continuous variable controlled quantum dialogue scheme is proposed. The scheme is further modified to obtain two other protocols of continuous variable secure multiparty computation.
Pathak, Anirban, Saxena, Ashwin, Thapliyal, Kishore   +2 more
core  

The least primitive roots mod p

Journal of Mathematical Cryptology
Let p>1p\gt 1 be a large prime number, and let ε>0\varepsilon \gt 0 be a small number. The established unconditional upper bounds of the least primitive root u≠±1,v2u\ne \pm 1,{v}^{2} in the prime finite field Fp{{\mathbb{F}}}_{p} have exponential ...
Carella Nelson
doaj   +1 more source

A Universally Composable Linkable Ring Signature Supporting Stealth Addresses

Mathematics
The linkable ring signature supporting stealth addresses (SALRS) is a recently proposed cryptographic primitive, which is designed to comprehensively address the soundness and privacy requirements associated with concealing the identities of both the ...
Xingkai Wang, Chunping Zhu, Zhen Liu
doaj   +1 more source

On the Round Security of Symmetric-Key Cryptographic Primitives [PDF]

, 2000
Zulfikar Ramzan, Leonid Reyzin
openalex   +1 more source