Stereo-vision is generally considered to provide information about depth in a visual scene derived from disparities in the positions of an image on the two eyes; a new study has found evidence that retinal-image codin...
详细信息
Stereo-vision is generally considered to provide information about depth in a visual scene derived from disparities in the positions of an image on the two eyes; a new study has found evidence that retinal-image coding relative to the head is also important.
It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian groups and that algebraic geometry provides a supply of such groups through Abelian varieties over finite fields. Of s...
详细信息
ISBN:
(数字)9781470417840
ISBN:
(纸本)9780821843116
It is by now a well-known paradigm that public-key cryptosystems can be built using finite Abelian groups and that algebraic geometry provides a supply of such groups through Abelian varieties over finite fields. Of special interest are the Abelian varieties that are Jacobians of algebraic curves. All of the articles in this volume are centered on the theme of point counting and explicit arithmetic on the Jacobians of curves over finite fields. The topics covered include Schoof's $\ell$-adic point counting algorithm, the $p$-adic algorithms of Kedlaya and Denef-Vercauteren, explicit arithmetic on the Jacobians of $C_{ab}$ curves and zeta functions.
This volume is based on seminars on algebraic curves and cryptography held at the GANITA Lab of the University of Toronto during 2001–2008. The articles are mostly suitable for independent study by graduate students who wish to enter the field, both in terms of introducing basic material as well as guiding them in the literature. The literature in cryptography seems to be growing at an exponential rate. For a new entrant into the subject, navigating through this ocean can seem quite daunting. In this volume, the reader is steered toward a discussion of a few key ideas of the subject, together with some brief guidance for further reading. It is hoped that this approach may render the subject more approachable.
Several sufficient conditions for quadratic bent func tions represented by trace are given. These sufficient conditions correspond to two families of quadratic bent functions in poly nomial forms. Furthermore, the fir...
详细信息
Several sufficient conditions for quadratic bent func tions represented by trace are given. These sufficient conditions correspond to two families of quadratic bent functions in poly nomial forms. Furthermore, the first family of bent functions includes the function proposed by Udaya and some functions proposed by Hu and Feng.
This paper describes a new design of Reed-Solomon (RS) codes when using composite extension fields. Our ultimate goal is to provide codes that remain Maximum Distance Separable (MDS), but that can be processed at high...
详细信息
ISBN:
(纸本)9783800749485
This paper describes a new design of Reed-Solomon (RS) codes when using composite extension fields. Our ultimate goal is to provide codes that remain Maximum Distance Separable (MDS), but that can be processed at higher speeds in the encoder and decoder. This is possible by using coefficients in the generator matrix that belong to smaller (and faster) finite fields of the composite extension and limiting the use of the larger (and slower) finite fields to a minimum. We provide formulae and an algorithm to generate such constructions starting from a Vandermonde RS generator matrix and show that even the simplest constructions, e.g., using only processing in two finite fields, can speed up processing by as much as two-fold compared to a Vandermonde RS and Cauchy RS while using the same decoding algorithm, and more than two-fold compared to other RS Cauchy and FFT-based RS.
A correction to the article 'The Receptors And coding Logic for Bitter Taste,' by K.L. Mueller, M.A. Hoon, I. Erlenbach, J. Chandrashekar, C.S. Zuker and N.J.P. Ryba that was published in the earlier issue of ...
详细信息
A correction to the article 'The Receptors And coding Logic for Bitter Taste,' by K.L. Mueller, M.A. Hoon, I. Erlenbach, J. Chandrashekar, C.S. Zuker and N.J.P. Ryba that was published in the earlier issue of the journal 'Nature' is presented.
In this paper a novel (t, n) threshold image secret sharing scheme is proposed. Based on the idea that there is close connection between secret sharing and coding theory, coding method on GF(2~m) is applied in our sch...
详细信息
ISBN:
(纸本)9781467369985
In this paper a novel (t, n) threshold image secret sharing scheme is proposed. Based on the idea that there is close connection between secret sharing and coding theory, coding method on GF(2~m) is applied in our scheme instead of the classical Lagrange's interpolation method in order to deal with the fidelity loss problem in the recovery. All the generated share images are meaningful and the size of each share image is the same as the secret image. The analysis proves our scheme is perfect and ideal and also has high security. The experiment results demonstrate that all the shares have high quality and the secret image can be recovered exactly.
暂无评论