NTRUSign is digital signature algorithm based on lattices which is assumed to be quantum computer secure in contrast to RSA and ECC. Questions specifically about NTRUSign which are not related to programming should be asked on https://crypto.stackexchange.com/
Questions tagged [ntrusign]
5 questions
3
votes
0 answers
Is there any NTRU alternative to GnuPG (either with (secure!) NTRUSign or different digital signature algorithm)?
I am looking for (potentially) more secure alternative to GnuPG (which is based on RSA and Elgamal). So I am curious if is there any working implementation of NTRU algorithms with same capabilities as GnuPG. I know that there is a lot of…

Pter
- 127
- 3
- 8
2
votes
1 answer
What is definition of truncated polynomial?
In NTRUEncryption, I seen the trucated polynimials, but I cannot understand the trunacated polynomial calculation.
So, could tell me anyone How we calculate the truncated polynomial?

sravan nagiri
- 95
- 3
- 10
2
votes
6 answers
NTRUEncrypt source code?
Can anybody point me to C or Java code (or anything else) that does NTRU encryption?
Several people who were implementing the algorithm have posted on this site, so maybe they could help?
I also noticed that quite a number of NTRU implementations…

ApplesOranges
- 143
- 1
- 7
2
votes
3 answers
bouncycastle fails NTRU generation
There are three types of default security levels of NTRU, implemented in bouncy-castle:
1. NTRUSigningKeyGenerationParameters.TEST157
2. NTRUSigningKeyGenerationParameters.APR2011_439
3. NTRUSigningKeyGenerationParameters.APR2011_743
First two…

user3038475
- 343
- 1
- 3
- 8
1
vote
2 answers
Resultant of a polynomial with x^n–1
Resultant of a polynomial with x^n–1 (mod p)
I am implementing the NTRUSign algorithm as described in http://grouper.ieee.org/groups/1363/lattPK/submissions/EESS1v2.pdf , section 2.2.7.1 which involves computing the resultant of a polynomial. I keep…

devin.omalley
- 56
- 4