1. E Bach (1991). Toward a theory of Pollard's rho method. Information and Computation, 90(2), 139-155.
2. G Banavar,A Bernstein (2002). Software infrastructure and design challenges for ubiquitous computing applications. Communications of the ACM, 45(12), 92-96.
3. R Brent (2010). Some integer factorization algorithms using elliptic curves. Some integer factorization algorithms using elliptic curves
4. V Davis,S Cutino,M Berg,F Conklin,S Pringle (2001). U.S. Patent and Trademark Office-Patent Information. Federal Regulatory Research, 6, 60-73.
5. D Denning,P Denning (1998). Internet besieged: Countering cyberspace scofflaws. Internet besieged: Countering cyberspace scofflaws
6. Taher Elgamal (1985). A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. Lecture Notes in Computer Science, 10-18.
7. R Ferri,M Kim,E Yee (2004). Patent reports for enzyme and microbial technology. Enzyme and Microbial Technology, 34(7), 682-684.
8. Klaus Finkenzeller (1999). RFID Handbook. RFID Handbook, 151-158.
9. Dan Gordon (2011). Discrete Logarithm Problem. Encyclopedia of Cryptography and Security, 352-353.
10. D Johnson,A Menezes,S Vanstone (2001). The elliptic curve digital signature algorithm (ECDSA). International Journal of Information Security, 1(1), 36-63.
11. N Kanayama,T Kobayashi,T Saito,S Uchiyama (2000). Remarks on elliptic curve discrete logarithm problems. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 83(1), 17-23.
12. N Koblitz (1987). Elliptic curve cryptosystems. Mathematics of computation, 48(177), 203-209.
13. S Lahiri (2005). RFID sourcebook. RFID sourcebook
14. M Mcloone,M Robshaw (2006). Public Key Cryptography and RFID Tags. Lecture Notes in Computer Science, 372-384.
15. A Messer,I Greenberg,P Bernadat,D Milojicic,Deqing Chen,T Giuli,Xiaohui Gu (2002). Towards a distributed platform for resource-constrained devices. Proceedings 22nd International Conference on Distributed Computing Systems, 43-51.
16. V Miller (1986). Use of elliptic curves in cryptography. Advances in Cryptology-CRYPTO'85 Proceedings, 417-426.
17. P Montgomery (1994). A survey of modern integer factorization algorithms. CWI quarterly, 7(4), 337-366.
18. René Peralta (1986). Simultaneous Security of Bits in the Discrete Log. Lecture Notes in Computer Science, 62-72.
19. J Pollard (2000). Kangaroos, monopoly and discrete logarithms. Journal of cryptology, 13(4), 437-447.
20. Wolfgang Rankl,Wolfgang Effing (2010). Smart Card Handbook. Smart Card Handbook
21. Victor Shoup (1995). A New Polynomial Factorization Algorithm and its Implementation. Journal of Symbolic Computation, 20(4), 363-397.
22. Joseph Silverman,Joe Suzuki (1998). Elliptic Curve Discrete Logarithms and the Index Calculus. Lecture Notes in Computer Science, 110-125.
23. N Smart (2001). The exact security of ECIES in the generic group model. Cryptography and Coding, 73-84.
24. W Zhao,K Ramamritham,J Stankovic (1987). Scheduling tasks with resource requirements in hard real-time systems. Software Engineering, IEEE Transactions on, 564-577.
