Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the other hand, RSA cryptography has been widely used and it is defined over a certain composite order as the modulus. In detail, it generally needs to be a product of two large prime numbers. In order to apply RSA-based techniques to pairing-based cryptography, pairing friendly curve needs to have such a composite order. This paper focuses on some non-supersingular pairing friendly curves whose order r has two large prime factors and embedding degree k is equal to 1. This paper shows some experimental results on generating such a composite order curve and Tate pairing.