<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>Dr. K.V. Pramod</title>
<link href="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2005" rel="alternate"/>
<subtitle/>
<id>http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2005</id>
<updated>2013-05-20T05:59:12Z</updated>
<dc:date>2013-05-20T05:59:12Z</dc:date>
<entry>
<title>A Cryptosystem Using the Concepts of Algebraic Geometric Code</title>
<link href="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2007" rel="alternate"/>
<author>
<name>Pramod, K V</name>
</author>
<author>
<name>Manju, C</name>
</author>
<id>http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2007</id>
<updated>2010-12-06T20:31:11Z</updated>
<published>2010-01-01T00:00:00Z</published>
<summary type="text">A Cryptosystem Using the Concepts of Algebraic Geometric Code
Pramod, K V; Manju, C
Cryptosystem using linear codes was developed in 1978 by Mc-Eliece.&#13;
Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of&#13;
linear codes. But these systems were not used frequently because of its larger key size. In this study we&#13;
were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key size.&#13;
Error detection and correction can be done efficiently by simple decoding methods using the&#13;
cryptosystem developed. Approach: Algebraic geometric codes are codes, generated using curves.&#13;
The cryptosystem use basic concepts of elliptic curves cryptography and generator matrix. Decrypted&#13;
information takes the form of a repetition code. Due to this complexity of decoding procedure is&#13;
reduced. Error detection and correction can be carried out efficiently by solving a simple system of&#13;
linear equations, there by imposing the concepts of security along with error detection and correction.&#13;
Results: Implementation of the algorithm is done on MATLAB and comparative analysis is also done&#13;
on various parameters of the system. Attacks are common to all cryptosystems. But by securely&#13;
choosing curve, field and representation of elements in field, we can overcome the attacks and a stable&#13;
system can be generated. Conclusion: The algorithm defined here protects the information from an&#13;
intruder and also from the error in communication channel by efficient error correction methods.
</summary>
<dc:date>2010-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>On Implementing Joins, Aggregates and Universal Quantifier in Temporal Databases using SQL Standards</title>
<link href="http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2006" rel="alternate"/>
<author>
<name>Pramod, K V</name>
</author>
<author>
<name>Unnikrishnan, K</name>
</author>
<id>http://dyuthi.cusat.ac.in:80/xmlui/handle/purl/2006</id>
<updated>2010-12-04T20:30:57Z</updated>
<published>2009-01-01T00:00:00Z</published>
<summary type="text">On Implementing Joins, Aggregates and Universal Quantifier in Temporal Databases using SQL Standards
Pramod, K V; Unnikrishnan, K
A feasible way of implementing a temporal&#13;
database is by mapping temporal data model onto a&#13;
conventional data model followed by a commercial database&#13;
management system. Even though extensions were proposed&#13;
to standard SQL for supporting temporal databases, such&#13;
proposals have not yet come across standardization&#13;
processes. This paper attempts to implement database&#13;
operators such as aggregates and universal quantifier for&#13;
temporal databases, implemented on top of relational&#13;
database systems, using currently available SQL standards.
</summary>
<dc:date>2009-01-01T00:00:00Z</dc:date>
</entry>
</feed>
