Titlebook: Cryptography and Information Security in the Balkans; Second International Enes Pasalic,Lars R. Knudsen Conference proceedings 2016 Springe

桌前不可入

书目名称Cryptography and Information Security in the Balkans影响因子(影响力)




书目名称Cryptography and Information Security in the Balkans影响因子(影响力)学科排名




书目名称Cryptography and Information Security in the Balkans网络公开度




书目名称Cryptography and Information Security in the Balkans网络公开度学科排名




书目名称Cryptography and Information Security in the Balkans被引频次




书目名称Cryptography and Information Security in the Balkans被引频次学科排名




书目名称Cryptography and Information Security in the Balkans年度引用




书目名称Cryptography and Information Security in the Balkans年度引用学科排名




书目名称Cryptography and Information Security in the Balkans读者反馈




书目名称Cryptography and Information Security in the Balkans读者反馈学科排名

ablate

On the Efficiency of Polynomial Multiplication for Lattice-Based Cryptography on GPUs Using CUDAmentations of polynomial multiplications into a lattice-based signature scheme proposed by Güneysu et al. (CHES 2012) and identify which algorithm is the preferable choice with respect to the ring of degree ..

营养

Conference proceedings 2016ec 2015, held in Koper, Slovenia, in September 2015..The 12 papers presented inthis volume were carefully reviewed and selected from 27 submissions. They areorganized in topical sections named: symmetric key cryptography; cryptanalysis;security and protocols; and implementation and verifiable encryp

睨视

0302-9743 mation Security inthe Balkans, BalkanCryptSec 2015, held in Koper, Slovenia, in September 2015..The 12 papers presented inthis volume were carefully reviewed and selected from 27 submissions. They areorganized in topical sections named: symmetric key cryptography; cryptanalysis;security and protocol

策略

Web Caching and Its Applicationslgebraic immunity. This new approach, which exploits properties of the punctured Reed–Muller codes, suffices to generate a large number of new functions with maximum algebraic immunity through swapping an arbitrary number of elements between the support of . and its complement.

inquisitive

Fault Tolerance in Caching Systemsprobabilities significantly higher than the random case. We note that the presented results do not threaten the security of the scheme. This is the first external analysis of the authenticated cipher MORUS.

inquisitive

无聊点好

Fault Tolerance in Caching Systems, the corresponding bias and the number of effective bits depend crucially on the parity position chosen, and may lead not only to reduction but as well to growth in complexity of successful linear cryptanalysis compared to that towards the original DES.

Cumulus

Fault Tolerance in Caching Systems than the multiplication depth of the leveled multi-linear map in the scheme in [.]. Selective security of the proposed scheme in the standard model is proved, under the decisional multi-linear Diffie-Hellman assumption.

AV-node

Cryptographically Strong S-Boxes Generated by Modified Immune Algorithmnal selection algorithm, combined with a slightly modified hill climbing method for S-boxes. Using this special algorithm we generate large sets of highly nonlinear bijective S-boxes of low differential uniformity in a reasonable search time.