I wanted to show the relation between convolution and polynomial multiplication like it is showed here. I saw in this thread a similar approach to mine but with same degrees for both polynomials. So what I try to show is that $$p*q \equiv pq \mod x^{n}-1 $$ but I don't really know how I can continue my calculation to get to this form (but I don't really get this form like in the threads I linked).
$ p(x)q(x) = \\ \sum_{k=0}^{m+n}(\sum_{j=0}^k a_{k-j}b_{j})x^k = \\ \sum_{k=0}^{m}(\sum_{j=0}^k a_{k-j}b_{j})x^k + \sum_{k=m}^{m+n}(\sum_{j=0}^k a_{k-j}b_{j})x^k = \\ \sum_{k=0}^{m}(\sum_{j=0}^k a_{k-j}b_{j})x^k + \sum_{k=0}^{n}(\sum_{j=m}^{k+m} a_{k-j+m}b_{j-m})x^{k+m} = \\ \sum_{k=0}^{m}(\sum_{j=0}^k a_{k-j}b_{j})x^k + x^m(\sum_{k=0}^{n-1}(\sum_{j=m}^{k+m} a_{k-j+m}b_{j-m})x^{k}+x^{n}\sum_{j=m}^{n+m}a_{n-j+m}b_{j-m}) $