A new five elements joint sparse form is proposed and is researched deeply in this paper.It is proved that every pair of integers has an unique five elements joint sparse form and average joint hamming weight of this five elements joint sparse form is 1/3
l
if the binary representations length of this pair of integers is
l
.We apply this five elements joint sparse form to fast Shamir algorithm.Comparing with three elements joint sparse form
this algorithm saves 0.167
l
addition operations.Comparing with existed five elements joint sparse form