相关论文: Discrete Logarithms in Generalized Jacobians

This letter presents a cryptanalysis of the modified McEliece cryptosystem recently proposed by Moufek, Guenda and Gulliver [24]. The system is based on the juxtaposition of quasi-cyclic LDPC and quasi-cyclic MDPC codes. The idea of our…

We introduce and systematically develop two classes of discrete integrable operators: those with $2\times 2$ matrix kernels and those possessing general differential kernels, thereby generalizing the discrete analogue previously studied. A…

Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.…

In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding. The public key…

The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation $U=\sum \limits_{i=1}^n {V_i x_{i}}$. A proper implementation of DEHP would render an attacker to search for private parameters…

Chip firing provides a way to study the sandpile group (also known as the Jacobian) of a graph. We use a generalized version of chip firing to bound the number of invariant factors of the critical group of an arithmetical structure on a…

Motivated by deep neural networks, the deep Gaussian process (DGP) generalizes the standard GP by stacking multiple layers of GPs. Despite the enhanced expressiveness, GP, as an $L_2$ regularization prior, tends to be over-smooth and…

Of the many families of cryptographic schemes proposed to be post-quantum, a relatively unexplored set of examples comes from group-based cryptography. One of the more central schemes from this area is the so-called Semidirect Product Key…

The Ring Learning-With-Errors (LWE) problem, whose security is based on hard ideal lattice problems, has proven to be a promising primitive with diverse applications in cryptography. There are however recent discoveries of faster algorithms…

In [CS01, Page 109] Grothendieck sketches the construction of a complex J_*(X) or commutative pro-algebraic groups, associated to a smooth variety X, and for which each J_i(X) is a product of local factors called the local generalized…

Protocols satisfying Local Differential Privacy (LDP) enable parties to collect aggregate information about a population while protecting each user's privacy, without relying on a trusted third party. LDP protocols (such as Google's RAPPOR)…

In this work we consider a quantum generalization of the task considered by Slepian and Wolf [1973] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send…

An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…

We develop a generalized hybrid iterative approach for computing solutions to large-scale Bayesian inverse problems. We consider a hybrid algorithm based on the generalized Golub-Kahan bidiagonalization for computing Tikhonov regularized…

We describe a probability distribution on isomorphism classes of principally quasi-polarized p-divisible groups over a finite field k of characteristic p which can reasonably be thought of as "uniform distribution," and we compute the…

In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…

The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…

We study the problem of privacy-preserving $k$-means clustering in the horizontally federated setting. Existing federated approaches using secure computation suffer from substantial overheads and do not offer output privacy. At the same…

Jacobi brackets (a generalization of standard Poisson brackets in which Leibniz's rule is replaced by a weaker condition) are extended to brackets involving an arbitrary (even) number of functions. This new structure includes, as a…

We consider the problem of estimating sparse discrete distributions under local differential privacy (LDP) and communication constraints. We characterize the sample complexity for sparse estimation under LDP constraints up to a constant…