Titlebook: Coding and Cryptology; Third International Yeow Meng Chee,Zhenbo Guo,Chaoping Xing Conference proceedings 2011 Springer Berlin Heidelberg

fallible

Hallmark

Commodious

Local Duality and the Discrete Logarithm Problem,s polynomial time equivalent to computing discrete logarithm in finite fields. When the local field dose not contains the necessary roots of unity, similar results can be obtained at the cost of going to an extension that does contain these roots of unity.

diathermy

ALLAY

0302-9743 ernational Workshop on Coding and Cryptology, IWCC 2011, held in Qingdao, China, May 30-June 3, 2011. The 19 revised full technical papers are contributed by the invited speakers of the workshop. The papers were carefully reviewed and cover a broad range of foundational and methodological as well as

运气

Cultivate

Seeing Ourselves Through Technology at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical counterparts. In this work we briefly survey the recent progress in constructions of locally decodable codes.

专横

Algorithms for the Shortest and Closest Lattice Vector Problems,ved from the Ajtai, Kumar and Sivakumar algorithm [STOC’01] and the enumeration algorithms originally elaborated by Kannan [STOC’83] and Fincke and Pohst [EUROCAL’83]. We concentrate on the theoretical worst-case complexity bounds, but also consider some practical facets of these algorithms.

FLAGR

Locally Decodable Codes: A Brief Survey, at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical counterparts. In this work we briefly survey the recent progress in constructions of locally decodable codes.

询问