NTRU - MaRDI portal

Author name not available (Why is that?)

Official website: https://github.com/NTRUOpenSourceProject/ntru-crypto

Source code repository: https://github.com/NTRUOpenSourceProject/ntru-crypto

Cited In (only showing first 100 items - show all)

A lattice attack on homomorphic NTRU with non-invertible public keys
Cryptanalysis of a code-based one-time signature
Distinguishing attack on the NTRUCipher encryption scheme
Improved lattice enumeration algorithms by primal and dual reordering methods
An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
EPiC: efficient privacy-preserving counting for MapReduce
Title not available (Why is that?)
Analysis of error terms of signatures based on learning with errors
An extension of Kannan's embedding for solving ring-based LWE problems
Lattice-based revocable certificateless signature
How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
Improvements of algebraic attacks for solving the rank decoding and MinRank problems
A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
An algebraic approach to the rank support learning problem
Implementation of lattice trapdoors on modules and applications
On removing rejection conditions in practical lattice-based signatures
Quantum key search for ternary LWE
Parallel symmetric attack on NTRU using non-deterministic lattice reduction
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
Choosing parameters for NTRUEncrypt
Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
How to meet ternary LWE keys
A trace map attack against special ring-LWE samples
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
Characterizing overstretched NTRU attacks
CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
Subterranean
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
How to find ternary LWE keys using locality sensitive hashing
On the higher-bit version of approximate inhomogeneous short integer solution problem
Towards quantum large-scale password guessing on real-world distributions
Revisiting lower dimension lattice attacks on NTRU
Efficiently processing complex-valued data in homomorphic encryption
Recovering NTRU Secret Key from Inversion Oracles
Title not available (Why is that?)
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
Compact privacy protocols from post-quantum and timed classical assumptions
\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
Identity based blind signature scheme over NTRU lattices
Ciminion
Explicit Hard Instances of the Shortest Vector Problem
A Lattice Based Public Key Cryptosystem Using Polynomial Representations
The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
CHIMERA
Multikey fully homomorphic encryption and applications
Cryptanalysis of a rank-based signature with short public keys
Title not available (Why is that?)
A signature scheme from the finite field isomorphism problem
Flattening NTRU for evaluation key free homomorphic encryption
Evaluating the potential for hardware acceleration of four NTRU-based key encapsulation mechanisms using software/hardware codesign
D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
On the design of hardware building blocks for modern lattice-based encryption schemes
Information Security and Privacy
Symplectic Lattice Reduction and NTRU
Covert authentication from lattices
New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
Lattice Reduction Algorithms: Theory and Practice
Fully homomorphic encryption from ring-LWE and security for key dependent messages
On random nonsingular Hermite normal form
Title not available (Why is that?)
Generalized Compact Knapsacks Are Collision Resistant
Homomorphic Encryption Standard
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
Title not available (Why is that?)
SWIFFT: A Modest Proposal for FFT Hashing
Lattice polly cracker cryptosystems
Algorithms for the shortest and closest lattice vector problems
Analyzing blockwise lattice algorithms using dynamical systems
Homomorphic AES evaluation using the modified LTV scheme
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
An efficient lattice reduction using reuse technique blockwisely on NTRU
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
Advances in Cryptology - CRYPTO 2003
On the geometry of cyclic lattices
Fully homomorphic encryption with relatively small key and ciphertext sizes
Better key sizes (and attacks) for LWE-based encryption
NTL
McEliece
FLASH
BLISS
CBraid
eBASH
Group key agreement for secure group communication in dynamic peer systems
Title not available (Why is that?)
Title not available (Why is that?)
HElib
TinyECC
CFS
eBACS
BKZ
Crypto++
ETRU
MaTRU
NTRUSign
SWIFFT
fpLLL
NTRUEncrypt
McBits
FHEW
GBLA

This page was built for software: NTRU