DNA polymorphism in Cab locus of tomato induced by tissue culture

Plants were regenerated from callus induced from leaf disc explants of a tomato F, hybrid heterozygous for three marker loci (a), without anthocyanin (aw), and hairless (hl). Regenerants were studied for somaclonal variation at the phenotypic level by scoring for variation in the marker loci, and at the DNA level by probing geomic DNA blots with a chlorophyll a/b binding protein (Cab-3C) cDNA sequence. While no variation was observed at the phenotypic level in over 950 somaclones studied, DNA polymorphism for the Cab locus could be detected in two out of 17 somaclones tested. Tissue culture induced variation at the phenotypic level for specific loci is very low (less than 0.001 for a, awor hl) but DNA sequence changes are induced at much greater frequency (- 0.1 for a multicopy gene family such as Cab).

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.