In this paper, we propose two algorithms based on the popular Bit Plane Splicing Least Significant Bit (LSB) Technique for secret data hiding inside images. One major disadvantage of Bit Plane Splicing LSB technique is its low hiding capacity which results in severe degradation of the cover image upon hiding large amount of data. The proposed algorithms overcome this issue by imposing hiding rules based on the intensity level of pixels. In addition the method for data hiding is done in a non sequential manner using linear congruent random number generators. Experiment results show that the proposed techniques called Optimum Intensity Based Distributed Hiding (OIBDH) technique and Linear Congruent Optimum Intensity Based Distributed Hiding with Key (LC-OIBDH-k) outperforms Bit Plane Splicing LSB technique as they have better hiding capacity with less degradation in the cover image. Furthermore, the proposed algorithms are tested using absolute entropy curves and results show that our proposed techniques have lower absolute entropy difference compared to Bit Plane Splicing LSB technique in all the tested images and for different secret data sizes.