The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the rapid development of DNA computing, there are some questions worth study that how to implement the arithmetic operations used in cryptosystem based on DNA computing models. This paper proposes an improved DNA computing model to calculate modular-multiplication over finite field GF(2n). Comparing to related works, both assembly time complexity and space complexity are more optimal. The computation...
In recent years, there are some questions worth study that how to implement the arithmetic operations based on DNA computing. This paper proposes that how to calculate modular-multiplication and modular-square simultaneously in one DNA computing model. This model approaches modular-multiplication and modular-square in the same way. It is given that the bitwise assembly rules manifested as 7746 types...
Two major advantages of DNA computing – huge memory capacity and high parallelism – are being explored for large-scale parallel computing, mass data storage and cryptography. Tile assembly model is a highly distributed parallel model of DNA computing. Finite field GF(2n) is one of the most commonly used mathematic sets for constructing public-key cryptosystem. It is still an open question that how...
DNA computing is a new method for computation using the technology in molecular biology. The enormous parallel computing ability of DNA computing brings new opportunities and challenges to the development of cryptography. DNA cryptography is a cutting-edge sciences which combines classical cryptogram and molecular computing. Finite field GF(2n) is one of the most commonly used mathematic sets for...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.