Results 51 to 60 of about 696 (69)

New lattice attacks on DSA schemes

Journal of Mathematical Cryptology, 2016
We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently.
Poulakis Dimitrios
doaj   +1 more source

Characterizing overstretched NTRU attacks

Journal of Mathematical Cryptology, 2020
Overstretched NTRU is a variant of NTRU with a large modulus. Recent lattice subfield and subring attacks have broken suggested parameters for several schemes.
De Micheli Gabrielle, Heninger Nadia, Shani Barak   +2 more
doaj   +1 more source

Detecting Encrypted and Unencrypted Network Data Using Entropy Analysis and Confidence Intervals. [PDF]

Entropy (Basel), 2023
Ticleanu OA, Popa T, Hunyadi DI, Constantinescu N.   +3 more
europepmc   +1 more source

Construction of LDPC convolutional codes via difference triangle sets. [PDF]

Des Codes Cryptogr, 2021
Alfarano GN, Lieb J, Rosenthal J.
europepmc   +1 more source

Codes from Jacobian surfaces

, 2015
This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible (possibly singular
Haloui, Safia
core  

Moderate-density parity-check codes from projective bundles. [PDF]

Des Codes Cryptogr, 2022
Bariffi J, Mattheus S, Neri A, Rosenthal J.   +3 more
europepmc   +1 more source

Low-rank parity-check codes over Galois rings. [PDF]

Des Codes Cryptogr, 2021
Renner J, Neri A, Puchinger S.
europepmc   +1 more source

Security analysis of ZKPoK based on MQ problem in the multi-instance setting

Journal of Mathematical Cryptology
Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank ...
Kahrobaei Delaram, Perret Ludovic, Vigorito Martina   +2 more
doaj   +1 more source

On the Dimension of Algebraic-Geometric Trace Codes

Mathematics, 2016
We study trace codes induced from codes defined by an algebraic curve X. We determine conditions on X which admit a formula for the dimension of such a trace code.
Phong Le, Sunil Chetty
doaj   +1 more source

A small serving of mash: (Quantum) algorithms for SPDH-Sign with small parameters

Journal of Mathematical Cryptology
We find an efficient method to solve the semidirect discrete logarithm problem (SDLP) over finite nonabelian groups of order p3{p}^{3} and exponent p2{p}^{2} for certain exponentially large parameters. This implies an attack on SPDH-Sign,Pronounced “SPUD-
Mendelsohn Andrew, Dable-Heath Edmund, Ling Cong   +2 more
doaj   +1 more source