相关论文: On a new fast public key cryptosystem

In 2019 G\'omez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme's design has a flaw which lets an attacker recover the…

While quantum key distribution (QKD) based on two-dimensional (qubit) encoding is a mature, field-tested technology, its performance is lacking for many cryptographic applications. High-dimensional encoding for QKD enables increased…

NTRU public key cryptosystem is well studied lattice-based Cryptosystem along with Ajtai-Dwork and GGH systems. Underlying NTRU is a hard mathematical problem of finding short vectors in a certain lattice. (Shamir 1997) presented a…

Inspired by Fujita's analysis [Quantum inf. & comput. 12(3&4), 2012], we suggest a twice-encryption scheme to improve the security of the original quantum McEliece public-key encryption algorithm.

Implementation security, higher generation rate, and lower cost are primary missions in the domain of quantum key distributions in recent years. However, simultaneously achieving robust security, high speed, and low cost often resembles an…

In this paper,we propose a modified Anshel-Anshel-Goldfeld(AAG) key exchange scheme. The hardness assumption underlying this modified construction is based on the membership problem for Mihailova subgroups of the braid group, a problem that…

In numerous networks, it is vital to identify communities consisting of closely joined groups of individuals. Such communities often reveal the role of the networks or primary properties of the individuals. In this perspective, Newman and…

We expand the recently discussed continuous-variable quantum key distribution scheme of Heid and Luetkenhaus (2006) to qudits with a lossy but noiseless quantum channel. Postselection methods are used. Secret key rates are calculated in the…

This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier…

In this short note we argue that the state-of-art inverted index based public key searchable encryption scheme proposed by Wang et al may not be completely correct by giving a counterexample.

We present a novel right-to-left long division algorithm based on the Montgomery modular multiply, consisting of separate highly efficient loops with simply carry structure for computing first the remainder (x mod q) and then the quotient…

An algorithm is presented which implements a probabilistic attack on the key-exchange protocol based on permutation parity machines. Instead of imitating the synchronization of the communicating partners, the strategy consists of a Monte…

Quantum key distribution (QKD) is emerging as a cutting-edge application of quantum technology, gradually integrating into the industrial landscape. Many protocols employing discrete or continuous variables have been developed over time.…

We consider a generalisation of Ekert's entanglement-based quantum cryptographic protocol where qubits are replaced by qu$N$its (i.e., N-dimensional systems). In order to study its robustness against optimal incoherent attacks, we derive…

Akiyama et al. (Int. J. Math. Indust., 2019) proposed a post-quantum key exchange protocol that is based on the hardness of solving a system of multivariate non-linear polynomial equations but has a design strategy different from ordinary…

We introduce the \emph{linear centralizer method}, and use it to devise a provable polynomial time solution of the Commutator Key Exchange Problem, the computational problem on which, in the passive adversary model, the security of the…

This paper presents two modular grad-div algorithms for calculating solutions to the Navier-Stokes equations (NSE). These algorithms add to an NSE code a minimally intrusive module that implements grad-div stabilization. The algorithms do…

Temporal Key Integrity Protocol (TKIP) is the IEEE TaskGroupi solution for the security loop holes present in the already widely deployed 802.11 hardware. It is a set of algorithms that wrap WEP to give the best possible solution given…

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…

With the development of machine learning, it is difficult for a single server to process all the data. So machine learning tasks need to be spread across multiple servers, turning the centralized machine learning into a distributed one.…