Titlebook: Cryptography and Coding; 14th IMA Internation Martijn Stam Conference proceedings 2013 Springer-Verlag Berlin Heidelberg 2013 cloud cryptog

BRAND

Kin Chi Lau,Rafael Escobedo,David Barkine one-time public key by a standard signature. Second, we introduce a zero-knowledge variation on the Stern authentication scheme which permits to prove that one or two different syndromes are associated (or not) to the . low weight word. We give a polynomial reduction of the security of our scheme to the security of the syndrome decoding problem.

北極人

Exonerate

Reshma Yousuf,Zawiah Abdul Majidus methods have recommended, while still maintaining reasonable levels of security. As example applications we look at the evaluation of AES via FHE operations presented at Crypto 2012, and the parameters for the SHE variant of BGV used in the SPDZ protocol from Crypto 2012.

出來(lái)

Semi-bent Functions from Oval Polynomialstwo areas are important from a theoretical point of view and for applications), the connections between finite geometry and cryptography remain little studied. In 2011, Carlet and Mesnager have showed that projective finite geometry can also be useful in constructing significant cryptographic primit

Pituitary-Gland

磨碎

現(xiàn)暈光

grudging

inundate

On Minimal and Quasi-minimal Linear Codesuch codes have applications in cryptography, e.g. to secret sharing. We here study minimal codes, give new bounds and properties and exhibit families of minimal linear codes. We also introduce and study the notion of quasi-minimal linear codes, which is a relaxation of the notion of minimal linear c

純樸