When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Lattice-based cryptography - Wikipedia

    en.wikipedia.org/wiki/Lattice-based_cryptography

    Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof. Lattice-based constructions support important standards of post-quantum cryptography . [ 1 ]

  3. NTRU - Wikipedia

    en.wikipedia.org/wiki/NTRU

    NTRU is an open-source public-key cryptosystem that uses lattice-based cryptography to encrypt and decrypt data. It consists of two algorithms: NTRUEncrypt, which is used for encryption, and NTRUSign, which is used for digital signatures. Unlike other popular public-key cryptosystems, it is resistant to attacks using Shor's algorithm ...

  4. Lattice problem - Wikipedia

    en.wikipedia.org/wiki/Lattice_problem

    In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices.The conjectured intractability of such problems is central to the construction of secure lattice-based cryptosystems: lattice problems are an example of NP-hard problems which have been shown to be average-case hard, providing a test case for the security of cryptographic ...

  5. IEEE P1363 - Wikipedia

    en.wikipedia.org/wiki/IEEE_P1363

    IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography. It includes specifications for: Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) Lattice-based public-key cryptography (IEEE Std 1363.1-2008) Password-based public-key cryptography (IEEE Std 1363. ...

  6. NTRUEncrypt - Wikipedia

    en.wikipedia.org/wiki/NTRUEncrypt

    It is however too hard to find the secret key when the NTRUEncrypt parameters are chosen secure enough. The lattice reduction attack becomes harder if the dimension of the lattice gets bigger and the shortest vector gets longer. The chosen ciphertext attack is also a method which recovers the secret key f and thereby results in a total break ...

  7. Message authentication code - Wikipedia

    en.wikipedia.org/wiki/Message_authentication_code

    Formally, a message authentication code (MAC) system is a triple of efficient [4] algorithms (G, S, V) satisfying: G (key-generator) gives the key k on input 1 n, where n is the security parameter. S (signing) outputs a tag t on the key k and the input string x. V (verifying) outputs accepted or rejected on inputs: the key k, the string x and ...

  8. Kyber - Wikipedia

    en.wikipedia.org/wiki/Kyber

    Kyber is a key encapsulation mechanism (KEM) designed to be resistant to cryptanalytic attacks with future powerful quantum computers.It is used to establish a shared secret between two communicating parties without an attacker in the transmission system being able to decrypt it.

  9. Short integer solution problem - Wikipedia

    en.wikipedia.org/wiki/Short_integer_solution_problem

    The Short Integer Solution (SIS) problem is an average case problem that is used in lattice-based cryptography constructions. Lattice-based cryptography began in 1996 from a seminal work by Ajtai [ 1 ] who presented a family of one-way functions based on the SIS problem.