EuDML | Browse

Page 1

Displaying 1 – 9 of 9

Scalable PP-1 block cipher

Krzysztof Bucholc, Krzysztof Chmiel, Anna Grocholewska-Czuryło, Ewa Idzikowska, Izabela Janicka-Lipska, Janusz Stokłosa (2010)

International Journal of Applied Mathematics and Computer Science

A totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated...

Secret sharing schemes for ports of matroids of rank 3

Oriol Farràs (2020)

Kybernetika

A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid. Namely, the minimal authorized subsets of an ideal secret sharing scheme are in correspondence with the circuits of a matroid containing a fixed point. In this case, we say that the access structure is a matroid port. It is known that, for an access structure, being a matroid port is not...

Secret sharing schemes on sparse homogeneous access structures with rank three.

Martí-Farré, Jaume, Padró, Carles (2004)

The Electronic Journal of Combinatorics [electronic only]

Secure two-way on-line communication by using quasigroup enciphering with almost public key.

Markovski, S., Gligoroski, D., Stojčevska, B. (2000)

Novi Sad Journal of Mathematics

Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited

Zhengan Huang, Shengli Liu, Baodong Qin, Kefei Chen (2015)

International Journal of Applied Mathematics and Computer Science

Fehr et al. (2010) proposed the first sender-equivocable encryption scheme secure against chosen-ciphertext attacks (NCCCA) and proved that NC-CCA security implies security against selective opening chosen-ciphertext attacks (SO-CCA). The NC-CCA security proof of the scheme relies on security against substitution attacks of a new primitive, the “crossauthentication code”. However, the security of the cross-authentication code cannot be guaranteed when all the keys used in the code are exposed. Our...

Serie de Lucas y criptografía.

André Warusfel (1995)

Collectanea Mathematica

Some observations on the cryptographic hash functions.

Ciungu, Lavinia (2004)

Acta Universitatis Apulensis. Mathematics - Informatics

Structure of unitary groups over finite group rings and its application

Jizhu Nan, Yufang Qin (2010)

Czechoslovak Mathematical Journal

In this paper, we determine all the normal forms of Hermitian matrices over finite group rings $R = F_{q^{2}} G$ , where $q = p^{α}$ , $G$ is a commutative $p$ -group with order $p^{β}$ . Furthermore, using the normal forms of Hermitian matrices, we study the structure of unitary group over $R$ through investigating its BN-pair and order. As an application, we construct a Cartesian authentication code and compute its size parameters.

Study of the Information Security of File Objects under Information Attacks with a Record of Effect of the Methods of Compression

Polimirova-Nickolova, Dimitrina (2008)

Serdica Journal of Computing

This report examines important issues pertaining to the different ways of affecting the information security of file objects under information attacks through methods of compression. Accordingly, the report analyzes the three-way relationships which may exist among a selected set of attacks, methods and objects. Thus, a methodology is proposed for evaluation of information security, and a coefficient of information security is created. With respects to this coefficient, using different criteria...

Displaying 1 – 9 of 9

Currently displaying 1 – 9 of 9