The fast implementation of elliptic curve cryptography has always been a research hotspot in this field, among which the non-adjacent representation of binary numbers (NAF) is widely used. It is mainly used in point multiplication. The NAF used in this algorithm is composed of digits with symbolic bits, so it usually uses one-by-one storage mode. However, it is great waste on some devices with limited storage resources. In order to save storage resources, a binary representation of NAF is proposed, which can store multiple NAF values according to the word length of the running platform, and greatly improve the utilization of storage resources. On this basis, the algorithm of NAF binary representation and its point multiplication algorithm are given. The experimental results show that the efficiency of this representation has little influence on the efficiency of the original algorithm, especially in point multiplication, but it is outstanding in improving the storage efficiency and saving more than 96% of the storage.