Questions tagged [ntru]
NTRU is an encryption algorithm which is based on the shortest vector problem in a lattice.
114 questions
0
votes
1
answer
638
views
Convert message to polynomial NTRU
How to make a message into a polynomial? I saw many answers to this question and yes, i know that here are some questions. But i did not get it. I think that i am making some mistakes. I took a word ...
5
votes
4
answers
1k
views
Does NTRU provide Perfect Forward Secrecy?
Does NTRU provide Perfect Forward Secrecy if the world would use it in an HTTPS connection?
2
votes
0
answers
135
views
How can I make a message into a blocks for NTRU?
I have more bits than the degree of the NTRU polynomial.
For example: $x^{11}-1$
message: Hello (I am using ascii, 8 bits for 1 symbol)
got: ...
3
votes
1
answer
775
views
Illustrate NTRU using lattices
I studied some papers related to NTRU. All these papers describe NTRU as a lattice based cryptosystem but I could not find any paper which illustrates NTRU algorithm from lattice point of view. It ...
6
votes
2
answers
2k
views
NTRU crypto from unseen.is; myth busting help
I am always on the look out for privacy enhancing technologies. I stumbled upon the service from unseen.is. I had a look at their site (specifically here) and even though I lack knowledge there are a ...
1
vote
1
answer
339
views
Is the "secure-as-worst-case" version of NTRU patented?
Does the improved version of NTRU — which is described in "Making NTRU as Secure as Worst-Case Problems over Ideal Lattices" by
Stehlé and Steinfeld — fall under the same patents as the original?
2
votes
2
answers
3k
views
How to make a message into a polynomial on NTRU encryption?
How to make a message into a polynomial on NTRU encryption? for example how we can conver 'hello world' to polynomial...
i have read the converting operation on IEEE Std 1363.1- 2008, but i can't ...
0
votes
1
answer
217
views
reduces the coefficients of a modulo 3 on NTRU
i'm still don't understand about 'reduces the coefficients of a modulo 3' on NTRU tutorial
$a = f*e = 3 - 7X - 10X^2 - 11X^3 + 10X^4 + 7X^5 + 6X^6 + 7X^7 + 5X^8 - 3X^9 -7X^{10} \pmod{32}.$
Note ...
1
vote
0
answers
389
views
computing inverses in truncated polynomial rings manually for NTRU encryption [duplicate]
Can someone explain how to find inverses in truncated polynomial rings manually (i.e. on pen and paper)?
As an example from the tutorial:
Example. Take $N=7$, $q=11$, $a=3+2X^2-3X^4+X^6$. The ...
6
votes
1
answer
1k
views
Implementations of Ntru TLS
Has anyone come across any implementations of Ntru TLS? I'm working a project for uni that does quantum secure encryption. It relies on a mix of Ntru & AES, but I can't find an implementation of ...
1
vote
1
answer
711
views
NTRUEncrypt - Choose the initial random polynomial
I'm trying to implement NTRUEncrypt but encounter some problems. I've finished all the basic functions that are needed for the scheme base on this Document, but I can't find an algorithm to check the ...
9
votes
3
answers
2k
views
How can one sign with NTRU?
I am looking at implementing NTRU, but I noticed that while the encryption/decryption algorithm seems to be mature and well-documented, there is comparatively little information about how to sign ...
4
votes
2
answers
2k
views
Inverses in Truncated Polynomial Rings
I've been trying a long time to understand a thing which is obviously extremely simple, but I just can't get it.
Read this, please:
The NTRUEncrypt PKCS uses the ring of truncated polynomials $R$ ...
13
votes
3
answers
2k
views
Does NTRU decrypt correctly now?
The NTRU public-key cryptosystem has a lot of interesting properties (being resistant to quantum computer attacks, being standardized by several important bodies), but it also has a pretty unique ...