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.
Auxin-binding protein1 (ABP1) is an active element involved in auxin signaling and plays critical roles in auxin-mediated plant development. Here, we report the isolation and characterization of a putative sequence from Prunus salicina L., designated PslABP1. The expected protein exhibits a similar molecular structure to that of well-characterized maize-ABP1; however, PslABP1 displays more sequence...
Turbo code is a class of convolutional codes which have great deal of interest as they attain the ultimate limits of the capacity of communication channel. They are known as ??The ultimate Error Control Codes?? which made them move rapidly from research laboratories to practical applications throughout the world. The use of these codes has been proposed for several applications where highly reliable...
Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Key cryptography algorithms. Modular Exponentiation of large numbers requires excessive processing. An efficient implementation of modular exponentiation may help overcome the speed issues of public Key Cryptography. in this work, the most promising technique of Montgomery modular exponentiation and its...
Efficient finite field arithmetic is essential for fast implementation of Elliptic Curve Cryptography (ECC) in software environments. Finite field squaring is an important arithmetic operation in the binary finite field GF(2m). Squaring is required for many cryptographic techniques based on the Discrete Logarithm Problem (DLP) in the multiplicative group of a finite field or additive group of points...
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.