The security of many cryptographic systems relies on the difficulty of computing discrete
logarithms in certain finite groups. This dissertation studies existing cryptographic protocols …

This paper gives a survey on cryptographic hash functions. It gives an overview of all types
of hash functions and reviews design principals and possible methods of attacks. It also …

Advances in the design of Boolean functions using heuristic techniques are reported. A
genetic algorithm capable of generating highly nonlinear balanced Boolean functions is …

This paper reconsiders the established Merkle-Damgård design principle for iterated hash
functions. The internal state size w of an iterated n-bit hash function is treated as a security …

The first edition of this award-winning book attracted a wide audience. This second edition is
both a joy to read and a useful classroom tool. Unlike traditional textbooks, it requires no …

7. Correlation Matrices Page 1 7. Correlation Matrices In this chapter we consider correlations
over Boolean functions and iterated Boolean transformations. Correlations play an important …

В лекции рассматриваются основные понятия, связанные с криптографическими
протоколами, определяются их основные свойства и уязвимости. Приводятся примеры …

In this paper we suggest two new provably secure block ciphers, called BEAR and LION.
They both have large block sizes, and are based on the Luby-Rackoff construction. Their …

本书共3 篇15 章. 第1 篇为网络安全基础, 共3 章, 主要讨论了网络安全的基础知识,
并从网络协议安全性的角度出发, 阐述了当今计算机网络中存在的安全威胁; 第2 …

Recently, a technique called quotient cube was proposed as a summary structure for a data
cube that preserves its semantics, with applications for online exploration and visualization …