The routing protocols, one of the fundamental components in the operation of the Internet, lack basic efficient and effective security schemes to prevent internal and external attacks. Existing cryptographic techniques can protect IP routing infrastructure from external attack at the expense of performance but is difficult to protect a network from internal attacks. This paper describes a novel computational method for verifying routing messages in distance vector routing protocols that can effective and efficient to protect routing protocols from internal attacks such as mis-configuration or compromise.