A new DNA-based model for finite field arithmetic.

Area of Science:

• Molecular Computing
• Computational Mathematics
• Biotechnology

Background:

• Galois Fields (GF(2^n)) are crucial mathematical structures in cryptography and error-correcting codes.
• Existing DNA-based models for GF(2^n) arithmetic face limitations in parallelism, error-proneness, and implementation complexity.

Purpose of the Study:

• To propose a novel, efficient, and robust DNA-based model for arithmetic operations over Galois Fields (GF(2^n)).
• To demonstrate the practical applicability and advantages of this new molecular computing model.

Main Methods:

• Development of a DNA-based model utilizing Polymerase Chain Reaction (PCR) amplification and gel electrophoresis.
• Focus on DNA double-strand fragment size for encoding numerical values.
• Experimental validation of arithmetic calculations (addition and multiplication) over GF(2^n).

Main Results:

• The proposed model enables parallel arithmetic calculations over GF(2^n), overcoming limitations of previous models.
• The model exhibits reduced error rates due to reliance on established molecular techniques (PCR, gel electrophoresis).
• Achieved execution times of O(n) for addition and O(n^2) for multiplication over GF(2^n).

Conclusions:

• The novel DNA-based model provides a flexible, accurate, and simple approach for molecular arithmetic over Galois Fields.
• Experimental evidence validates the technical feasibility and efficiency of this model for cryptographic and coding theory applications.