Finite Field Arithmetic using Self-Assembly of DNA Tilings

Slides:

Advertisements

Similar presentations

Models of Computation Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 1, Lecture 2.

Advertisements

Chapter 11 Implementing an Assembler and a Linker Using C++ and Java.

Analysis of Algorithms CS 477/677

Finite Fields Rong-Jaye Chen. p2. Finite fields 1. Irreducible polynomial f(x)  K[x], f(x) has no proper divisors in K[x] Eg. f(x)=1+x+x 2 is irreducible.

BCH Codes Hsin-Lung Wu NTPU.

Mathematics of Cryptography Part II: Algebraic Structures

Linear Algebra over Finite Fields and Generic Domains in Maple Simon Lo, Michael Monagan Department of Mathematics, Simon Fraser University Introduction.

Algorithm Scheme. AddRoundKey Each round uses four different words from the expanded key array. Each column in the state matrix is XORed with a different.

Announcements: Ch 3 quiz next week (tentatively Friday). Will include fields (today) Ch 3 quiz next week (tentatively Friday). Will include fields (today)Today:

Lecture 14 Go over midterm results Algorithms Efficiency More on prime numbers.

Chapter 11 Algebraic Coding Theory. Single Error Detection M = (1, 1, …, 1) is the m  1 parity check matrix for single error detection. If c = (0, 1,

Forward Error Correction Steven Marx CSC45712/04/2001.

Complete MOLS of Small Finite Fields Abstract: This note explain how to use (p^{n}-1)-MOLS(GF(p^{n})).xls worksheet to compute complete MOLS of Finite.

Lecture 4 Discrete Mathematics Harper Langston. Algorithms Algorithm is step-by-step method for performing some action Cost of statements execution –Simple.

Announcements: Quizzes graded, but not in gradebook. (Current grade gives 0 on the parts you shouldn’t have done .) Quizzes graded, but not in gradebook.

Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,

Computer Organization Computer Organization & Assembly Language: Module 2.

FINITE FIELDS 7/30 陳柏誠.

Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.

Temperature Readings The equation to convert the temperature from degrees Fahrenheit to degrees Celsius is: c(x) = (x - 32) The equation to convert the.

Monoids, Groups, Rings, Fields

Small Finite Fields computation Abstract: This note describes how to use the GF(p^{n}).xls worksheet to compute Small Finite Fields. © César Bravo, 2009.

Advanced Algebraic Algorithms on Integers and Polynomials Prepared by John Reif, Ph.D. Analysis of Algorithms.

SIMULATING THE CONSTRUCTIONS OF FINITE FIELDS USING MAPLETS L OEKY H ARYANTO Mathematics Department, Hasanuddin University,

Data Security and Encryption (CSE348) 1. Lecture # 12 2.

Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.

Why program retro machines? Aren't they obsolete? Why not do something more constructive?

1 Fast Polynomial and Integer Multiplication Jeremy R. Johnson.

Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.

Solving Equations Binomials Simplifying Polynomials

Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,

The Advanced Encryption Standard Part 2: Mathematical Background

Dan Boneh Intro. Number Theory Arithmetic algorithms Online Cryptography Course Dan Boneh.

Hardware Implementations of Finite Field Primitives

Multiplicative Group The multiplicative group of Z n includes every a, 0

Public Key Cryptography. Asymmetric encryption is a form of cryptosystem in which Encryption and decryption are performed using the different keys—one.

Last Updated: Aug 25, Implement AES Use the FIPS 197 spec as your guide o Avoid looking at code on the Internet o Challenge yourself to implement.

EVEN NUMBERS EVEN NUMBERS 1 = prime 2 = prime1 3 = prime 4 = 2 x 22 5 = prime 6 = 2 x 33 7 = prime 8 = 2 x 2 x 24 9 = 3 x 3 10 = 2 x 55.

Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:

CS480 Cryptography and Information Security

Notes Over 3.4 The Rational Zero Test

Classical Encryption techniques

Elliptic Curves.

September 4, 1997 Applied Symbolic Computation (CS 300) Fast Polynomial and Integer Multiplication Jeremy R. Johnson.

Molecular Computation

Polynomials, Secret Sharing, And Error-Correcting Codes

لجنة الهندسة الكهربائية

Your Name Technology Mr. Hladis

Applied Symbolic Computation

CS 465 AES Last Updated: Sep 7, 2017.

September 4, 1997 Applied Symbolic Computation (CS 300) Fast Polynomial and Integer Multiplication Jeremy R. Johnson.

Computational and experimental analysis of DNA shuffling

Cryptography and Network Security

Polynomials, Secret Sharing, And Error-Correcting Codes

September 4, 1997 Applied Symbolic Computation (CS 567) Fast Polynomial and Integer Multiplication Jeremy R. Johnson.

Applied Symbolic Computation

Polynomial Functions and Their Graphs

DTTF/NB479: Dszquphsbqiz Day 17

Evaluating Logarithms

Private Key Algorithms Feistel Networks AES

Introduction to Modern Cryptography

Private Key Algorithms Feistel Networks AES

296.3:Algorithms in the Real World

Private Key Algorithms Feistel Networks AES

Fast Polynomial and Integer Multiplication

On the Computational Power of Insertion-Deletion Systems

Introduction to Modern Cryptography

Mathematical Background: Extension Finite Fields

Presentation transcript:

Finite Field Arithmetic using Self-Assembly of DNA Tilings Summarized by HaYoung Jang

DNA Tiles and Assembly

Finite Field Arithmetic Finite field: a field with a finite number of elements. GF(pn): each prime p and each natural number n, there exists a unique finite field of pn elements. The elements of this field can be represented as polynomials in x, of degree less than n and having coefficients from Zp={1, 2, …, p-1}.

Finite Field Multiplication

Basic step of computing B*x(moduloR)

Basic step of computing B*x(moduloR)

Input Tiles

Example computation of 4-bit finite field multiplication

Example computation of 4-bit finite field multiplication

Implementation Issues Constructing the input DNA strands Converting the input ssDNA to tiles Constructing the computation tiles & output tiles Executing the computation Reading the result

Conclusion Do you know “Word Game”? This is just another illusion.