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.
We propose a new method to efficiently encode attributes in the Camenisch-Lysyanskaya anonymous credential system. The new method is based on the Chinese remainder theorem. We show that with this method all attributes, including integer and string based attributes can be efficiently encoded. Also, we show that the number of bits needed for encoding attributes could be decreased by up to 48%. The protocols...
Sampling from the discrete Gaussian probability distribution is used in lattice-based cryptosystems. A need for faster and memory-efficient samplers has become a necessity for improving the performance of such cryptosystems. We propose a new algorithm for sampling from the Gaussian distribution that can efficiently change on-the-fly its speed/memory requirement. The Ziggurat algorithm that attempted...
Quantum-dot cellular automata (QCA) are nano-scale devices for implementing logic circuits. The disadvantage of QCA circuits is that its layout determines the timing of the circuit. This is the “layout = timing” problem in QCA circuits. Null convention logic (NCL) has been proposed as a solution to this problem. However the asynchronous registers used in NCL are bulky and require a large number of...
We propose an efficient, sub-optimal prefix code construction method for discrete sources with a finite alphabet and known probability mass function (pmf). It is well known that for a source that puts out symbols xi with probability pi, the optimal codeword lengths are li=log(1/pi). However, codeword lengths are integers and log(1/pi) is, in general, not an integer. We propose a method to find binary...
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.