Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Parthasarathy, B.
- An Analysis of Data Storage and Retrieval of File format System
Abstract Views :416 |
PDF Views:176
Authors
Affiliations
1 Dept. of Master of Computer Appl., Mailam Engg. College, Mailam-604 304, Villupuram Dt., Tamil Nadu, IN
1 Dept. of Master of Computer Appl., Mailam Engg. College, Mailam-604 304, Villupuram Dt., Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 2, No 9 (2009), Pagination: 38-40Abstract
The present work focuses on the analysis and examination of different types of file format system, storage devices and storage&retrieval systems which are most frequently used in the various applications. It is focused on the file format to identify the right file to right applications for the fast storing and accessing speed with less memory space along with the suitable file format on specific storage devices, RAM and processors. The analysis evolves based on different types of file format on different storage devices taking into account different research perspectives. The outcome of the work motivates multimedia applications users and developers for choosing appropriate file format, storage devices, RAM and processors to undertake their applications in a successful manner.Keywords
Data Storage, RAM, File Format SystemFull Text
References
- Abrahma Silberschatz, Hentry F. Korth and S. Sudharssan (2002) Database system concept. 5th Edition, Tata McGraw Hill.
- Anzelmo D (1971) Computers. IEEE Trans. on A Data-Storage Format for Information System Files. C-20 (1), 39–43.
- Gopalan Sivathanu, Charles P. Wright, and Erez Zadok (2005) Ensuring data integrity in storage techniques and applications. Stony Brook Univ., Computer Sci. Dept.
- Joseph C. Slater (2007) How to archive your/Thesis/ Dissertation/ Project Data. Write State Univ.
- Papadopoulos Marios Hadjieleftheriou AN and Zhang D (2007) Disk storage and basic file structures. Chapter 19 of Handbook of Database Technologies. Hammer J & Schneider M (eds.), CRC Press.
- Regan W. Moore (2000) The preservation of data, information and knowledge. Univ. of California, Sandiego.
- A Montgomery Representation of Elements in GF(25) for Efficient Arithmetic to Use in Elliptic Curve Cryptography
Abstract Views :176 |
PDF Views:0
Authors
Affiliations
1 Dr. Pauls Engineering College, Villupuram, TN, IN
2 Mailam Engineering College, Villupuram, TN, IN
3 School of Computing, SASTRA University, Thanjavur, TN, IN
1 Dr. Pauls Engineering College, Villupuram, TN, IN
2 Mailam Engineering College, Villupuram, TN, IN
3 School of Computing, SASTRA University, Thanjavur, TN, IN
Source
International Journal of Advanced Networking and Applications, Vol 1, No 5 (2010), Pagination: 323-326Abstract
Elliptic curve calculation was not introduced to cryptography until 1985. Compared with RSA, the advantage of elliptic curve cryptography lies in its ensuring the same security while the length of key of elliptic curve cryptography is much less than RSA cryptography and its lessening operation load. In this article a change of representation for elements in GF(25) is proposed to use in elliptic curve cryptography. The proposed representation is useful for architectures that implement Montgomery multiplication in the finite field GF(25). In fact, it needs virtually no cost in terms of conversion operations from a standard multiplication into a Montgomery multiplication.Keywords
Montgomery Multiplications, Finite Field, Elliptic Curve Cryptography (ECC), GF(25), Irreducible Polynomial.Full Text