  This paper proposes for every $n$, linear time reductions of the word and
conjugacy problems on the braid groups $B_n$ to the corresponding problems on
the braid monoids $B_n^+$ and moreover only using positive words
representations.
