EuDML | Browse

Page 1

Displaying 1 – 8 of 8

Edon- $ℛ (256, 384, 512)$ – an efficient implementation of Edon- $ℛ$ family of cryptographic hash functions

Danilo Gligoroski, Svein Johan Knapskog (2008)

Commentationes Mathematicae Universitatis Carolinae

We have designed three fast implementations of a recently proposed family of hash functions Edon– $ℛ$ . They produce message digests of length $n = 256, 384, 512$ bits and project security of $2^{\frac{n}{2}}$ hash computations for finding collisions and $2^{n}$ hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders $2^{256}$ , $2^{384}$ and $2^{512}$ that are constructed by using only bitwise...

Efficient covering designs of the complete graph.

Caro, Yair, Yuster, Raphael (1997)

The Electronic Journal of Combinatorics [electronic only]

Eigenvalues of nonsingular matices and combinatorial applications

Osvaldo Marrero (1976)

Revista colombiana de matematicas

Eine Charakterisierung der (i, j)-Pläne.

Karl Erich Wolff (1977)

Mathematische Zeitschrift

Einige einfache fahnenhomogene 3-Blockpläne.

Dieter Jungnickel, Thomas Beth (1983)

Mathematische Zeitschrift

Elliptic semiplanes and group divisible designs with orthogonal resolutions.

S.A. Vanstone, E.R. Lamken (1986)

Aequationes mathematicae

Existentially closed BIBD block-intersection graphs.

McKay, Neil A., Pike, David A. (2007)

The Electronic Journal of Combinatorics [electronic only]

Extremely primitive groups and linear spaces

Haiyan Guan, Shenglin Zhou (2016)

Czechoslovak Mathematical Journal

A non-regular primitive permutation group is called extremely primitive if a point stabilizer acts primitively on each of its nontrivial orbits. Let $𝒮$ be a nontrivial finite regular linear space and $G \leq Aut (𝒮) .$ Suppose that $G$ is extremely primitive on points and let rank $(G)$ be the rank of $G$ on points. We prove that rank $(G) \geq 4$ with few exceptions. Moreover, we show that $Soc (G)$ is neither a sporadic group nor an alternating group, and $G = PSL (2, q)$ with $q + 1$ a Fermat prime if $Soc (G)$ is a finite classical simple group.

Displaying 1 – 8 of 8

Currently displaying 1 – 8 of 8