Titlebook: Cryptography and Coding; 13th IMA Internation Liqun Chen Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 2011 anonymous

Bravura

Armory

Intuitive

LUT

多產(chǎn)子

Ensuring Message Embedding in Wet Paper Steganography In 2005, Fridrich . introduced wet paper codes to improve the undetectability of the embedding by enabling the sender to lock some components of the cover-data, according to the nature of the cover-medium and the message. Unfortunately, almost all existing methods solving the bounded decoding syndr

抓住他投降

吹牛大王

Parallelizing the Weil and Tate Pairingsic pairings were set on a single processor. In this paper, we describe our parallel implementation of the optimal ate pairing over Barreto-Naehrig (BN) curves that is about 1.23 times faster using two cores of an Intel Core?i5 or Core?i7 machine, and 1.45 times faster using 4 cores of the Core?i7 th

antipsychotic

On the Efficient Implementation of Pairing-Based Protocols However there has always been a question mark over the performance of such protocols. In response much work has been done to optimize pairing implementation, and now it is generally accepted that being pairing-based does not preclude a protocol from consideration as a practical proposition. However

GLUE

Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2ding degrees, although they are important for pairing-based cryptography over composite-order groups. This paper analyzes efficient pairings on ordinary elliptic curves of embedding degree 1 and 2 from the point of shortening Miller’s loop. We first show that pairing lattices presented by Hess can b

丑惡

Binary Kloosterman Sums with Value 4sums to develop and implement an algorithm to find the value 4 of such sums. We then present experimental results showing that the value 4 of binary Kloosterman sums gives rise to bent functions for small dimensions, a case with no mathematical solution so far.