Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly decode secret encrypted keys and making network vulnerable hacking. They can mathematical problems almost instantaneously compared billions of years computation needed by traditional computing machines. Researchers advocate development novel strategies include data encryption ...

The Number Theoretic Transform (NTT) is a powerful mathematical tool that has become increasingly important in developing Post Quantum Cryptography (PQC) and Homomorphic Encryption (HE). Its ability to efficiently calculate polynomial multiplication using the convolution theorem with quasi-linear complexity <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/19...

Some lattice-based public key cryptosystems allow one to transform ciphertext from one lattice or ring representation to another e ciently and without knowledge of public and private keys. In this work we explore this lattice transformation property from cryptographic engineering viewpoint. We apply ciphertext transformation to compress Ring-LWE ciphertexts and to enable e cient decryption on a...

Lattice-based cryptography (LBC), exploiting learning with error (LWE) problems, is a promising candidate for postquantum cryptography. The number theoretic transform (NTT) the latency- and energy-dominant process in computation of LWE problems. This article presents compact efficient in-MEmory NTT accelerator, named MeNTT, which explores an optimized near 6T SRAM array. Specifically designed p...

We briefly discuss the history of lattices and cryptography during the last fifteen years. A lattice is a discrete subgroup of R or equivalently the set L

We show a novel lattice-based scheme (PairTRU) which is a non-commutative variant of the NTRU. The original NTRU is defined via the ring of quotient with variable in integers and this system works in the ring R = Z[x] . We extend this system over Z× Z and it performs all of operations in the non-commutative ring M = M(k,Z×Z)[x] <(Ik×k,Ik×k)x−(Ik×k,Ik×k)> , where M is a matrix ring of k ×...

Currently, traditional flight data sharing models cannot resist quantum attacks, which poses the risk of leakage. The research on model against attack has become one hotspots. Lattice-based cryptography is recognized as an effective way to attacks. A consortium blockchain proposed in this paper resolve leakage during sharing. First, a new lattice-based multisignature scheme (Lamus) proposed, ca...

Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are provably as hard as approximate lattice problems in the worst case. Here we present a reduction from LWE problem to dihedral coset problem(DCP). We present a quantum algorithm to generate the input of the two point problem which hides the solution of LWE. We then give a new re...

August 2017 Notices of the AMs 709 In August 2015 the National Security Agency published a webpage announcing preliminary plans for transitioning to quantum-resistant algorithms (www.iad.gov /iad/programs/iad-initiatives/cnsa-suite.cfm). In December 2016 the National Institute of Standards and Technology (NIST) announced a call for proposals for quantum-resistant algorithms with a deadline of 3...