Pages that link to "Item:Q1746970"

The following pages link to NTRU prime: reducing attack surface at low cost (Q1746970):

Displaying 18 items.

• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
• NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
• Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
• A framework for cryptographic problems from linear algebra (Q2023808) (← links)
• Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (Q2055676) (← links)
• On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
• A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
• Quantum key search for ternary LWE (Q2118530) (← links)
• How to meet ternary LWE keys (Q2128581) (← links)
• The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
• Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (Q2415416) (← links)
• The direction of updatable encryption does not matter much (Q2691597) (← links)
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
• Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
• Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
• Efficient Implementation of Hybrid Encryption from Coding Theory (Q5739039) (← links)
• A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)