Faculty of Mathematics and Computer Science

Computational algebra |

Code |
Semes-ter |
Hours: C+S+L |
Credits |
Type |
Section |

Teaching Staff in Charge |

Lect. SACAREA Cristian, Ph.D., csacarea@math.ubbcluj.ro Lect. CRIVEI Septimiu, Ph.D., crivei@math.ubbcluj.ro |

Aims |

An introduction to Computational Algebra by a survey of applications of algebraic algorithms in Cryptography, Coding Theory and Conceptual Knowledge Processing and Representation. |

Content |

1. Notions of algorithms complexity. The O notation, classes of complexity.
2. Congruences and residue classes. Euclid's algorithm, Euler's function, Chinese remainder theorem, public key cryptography: RSA, ElGamal. Electronic signature. Cryptanalysis. 3. Primality tests. Fermat, Solovay-Strassen, quadratic residues, Legendre's symbol. 4. Coding and decoding systems. Linear codes, cyclic codes, Reed-Mulles codes. Factorizing algorithms and applications in the construction of decoding systems. 5. Conceptual Knowledge Processing, Conceptual Knowledge Representation, Conceptualll browsing of data bases, applications in management and economics. Algorithms for graphical representation of knowledge. |

References |

1. W. Bosma, A. van der Porten, Computational Algebra and Number Theory, Kluwer 1995.
2. D. Bressoud, S. Wagon, A Course in Computational Number Theory, Springer-Verlag 2000. 3. H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag 2001. |

Assessment |

Exam. |