Random Linear Network Coding has been first introduced as a tool to maximize information flow across a network. This paradigm has been later proven to possess inherent weak security that arises from packet mixing. Motivated by this observation, an algorithm for secure data transmission using Random Linear Network Coding is proposed in this paper. The idea is to obscure the global encoding matrix via the use of a predefined matrix followed by a permutation step applied on its rows. A comparative analysis with similar algorithms in the literature is provided as a tool to evaluate the performance of the proposed algorithm.