OnBoard Security InSights

Closer to Proving the NTRU Assumption

Posted by Zhenfei Zhang on Apr 20, 2017 3:57:28 PM

NTRU is a cryptosystem that uses a special type of polynomial ring. The underlying hardness assumption, known as the NTRU assumption, is that an inverse of a short polynomial (polynomial whose coefficients are very short compared to the modulus q) is indistinguishable from a uniformly random polynomial in this ring. This indistinguishability is crucial in designing a cryptosystem.

Read More

Topics: NTRU, Cyptography, Quantum Computing, Internet of Things, Embedded Security

Changing Crypto Takes Longer Than You Expect

Posted by Gene Carter on Mar 28, 2017 3:20:14 PM

Even When You Expect it to Take Longer...


Read More

Topics: NTRU, Cyptography, Quantum Computing