Back to Search
Start Over
An efficient broadcast attack against NTRU
- Source :
- ASIACCS 2012-7th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2012-7th ACM Symposium on Information, Computer and Communications Security, ACM, May 2012, Seoul, South Korea. ⟨10.1145/2414456.2414467⟩, AsiaCCS
- Publication Year :
- 2012
- Publisher :
- HAL CCSD, 2012.
-
Abstract
- The NTRU cryptosystem is the most practical scheme known to date and has drawn considerable interest, which depends on three integer parameters (N, p, q) and four sets Lf, Lg, Lr, Lm of polynomials of degree N − 1 with small integer coefficients. We choose p, q such that gcd(p, q) = 1 and p is much smaller than q, denote the ring Z[x]/(xN -- 1) by R and the multiplication in R by *.
- Subjects :
- Ring (mathematics)
Theoretical computer science
Degree (graph theory)
Computer science
NTRU
0102 computer and information sciences
02 engineering and technology
01 natural sciences
Combinatorics
[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]
Integer
010201 computation theory & mathematics
Scheme (mathematics)
0202 electrical engineering, electronic engineering, information engineering
Cryptosystem
020201 artificial intelligence & image processing
Multiplication
ComputingMilieux_MISCELLANEOUS
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- ASIACCS 2012-7th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2012-7th ACM Symposium on Information, Computer and Communications Security, ACM, May 2012, Seoul, South Korea. ⟨10.1145/2414456.2414467⟩, AsiaCCS
- Accession number :
- edsair.doi.dedup.....506caeb30e08675eabe27113e91b25d1
- Full Text :
- https://doi.org/10.1145/2414456.2414467⟩