DNA kriptografija

master's thesis

• Author: Antonio Kovačić
• Mentor: Andrej Dujella (mentor)
• Committee member: Andrej Dujella (predsjednik povjerenstva)
• Committee member: Matija Kazalicki (član povjerenstva)
• Committee member: Juraj Šiftar (član povjerenstva)
• Committee member: Ljiljana Arambašić (član povjerenstva)
• Granter: University of Zagreb; Faculty of Science; (Department of Mathematics); Zagreb
• Defense date and country: 2014-07-14, Croatia
• Scientific / art field, discipline and subdiscipline: NATURAL SCIENCES; Mathematics

Abstract

DNA kriptografija predstavlja noviji model kriptiranja u teoriji računarstva, a koji upotrebljava koncept jednokratne bilježnice. Zbog iznimno guste raspodjele u memoriji DNA lanaca te složenim biokemijskim operacijama koje se mogu nad DNA lancima izvršiti paralelno (koncept masivnog paralelizma), nudi noviji pristup u teorijskom izračunavanju. Za razliku od RSA kriptosustava, DNA kriptografija je kvantno rezistentna te nudi sigurnost koja se oslanja na duljinu i jednokratnu upotrebljivost kriptografskog ključa. U ovom radu je predstavljen jedan način kriptiranja pomoću DNA lanaca. Osim toga, prikazan je matematički koncept DNA računala te kratka analiza njegove složenosti te primjena istoga na dva problema: problem nalaženja Hamiltonova puta, te korištenje DNA računala u svrhu napada na DES kriptosustav.

Abstract (english)

DNA cryptography, which uses the concept of a one-time pad, is a newer model of encryption in the computer science. Due to the extremely dense distribution in memory of DNA chains, and complex biochemical operations that can be performed over the DNA strands in parallel (the concept of massive parallelism), it provides greater approach to the theoretical calculation. Unlike RSA cryptosystem, DNA cryptography is quantum resistant and offers security that relies on length and one-usability of cryptographic keys. This thesis discusses a method of encryption using DNA chains. In addition, it presents a mathematical concept of DNA computers and a brief analysis of its complexity and the use of the same to solve two problems: the problem of finding Hamiltonian path, and the use of DNA computers in order to attack the DES cryptosystem.

• Keywords: DNA kriptografija; teorija računarstva; koncept jednokratne bilježnice; kriptografski ključ; matematički koncept DNA računala; problem nalaženja Hamiltonova puta; napad na DES kriptosustav
• Keywords (english): DNA cryptography; computer science; one-time pad concept; cryptographic key; mathematical concept of DNA computers; problem of finding Hamiltonian path; attacking the DES cryptosystem
• Language: croatian
• URN:NBN: urn:nbn:hr:217:185869
• Study programme: Title: Computer Science and Mathematics; Study programme type: university; Study level: graduate; Academic / professional title: magistar/magistra računarstva i matematike (magistar/magistra računarstva i matematike)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Open access
• Created on: 2019-02-19 11:19:28