Abstract
This paper proposes a DNA sticker algorithm for parallel reduction over finite field GF(2 n ). This algorithm is suitable for some specific finite fields defined with trinomials or pentanomials. We use one binary finite field GF(2 163 ) which is recommended by National Institute of Standards and Technology (NIST) to describe the details about our algorithm. The solution space of 2 325 cases could be figured out within 3059 DNA steps. This work also presents clear evidence of ability of DNA computing to perform complicated mathematic operations for elliptic curve cryptosystem over finite field GF(2 n ).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Grid and Distributed Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
