Wyniki wyszukiwania - BazTech

1

Hybrid Encryption from McEliece Cryptosystem with Pseudo-random Error Vector

Zajac Pavol

Fundamenta Informaticae

|

2019

|

Vol. 169, nr 4

345--360

EN

We propose a new hybrid encryption scheme to use with McEliece cryptosystem. The hybrid scheme uses specific authenticated encryption scheme for the encryption of the plaintext. The symmetric key is embedded in reversible way into the error vector of the McEliece cryptosystem. CCA2 security is provided by the symmetric part of the scheme. The embedding is done in such a way, that the error vector cannot be distinguished from a randomly chosen one. An eXtensible Output Function can be used to enable variable length conversion from (pseudo-random) bit strings to error vectors. The encryption part can be implemented in a streamed way, so the sender does not have to store the whole message in the memory.

2

Post-Quantum Cryptography: generalized ElGamal cipher over GF(2518)

Hecht P.

Theoretical and Applied Informatics

|

2016

|

Vol. 28, No. 4

1--14

EN

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks by means of for instance Shor's polynomial time algorithm for numerical field problems like integer factorization (IFP) or the discrete logarithm (DLP). Other aspects are the backdoors discovered in deterministic random generators or recent advances in solving some instances of DLP. The use of alternative algebraic structures like non-commutative or non-associative partial groupoids, magmas, monoids, semigroups, quasigroups or groups, are valid choices for these new kinds of protocols. In this paper, we focus in an asymmetric cipher based on a generalized ElGamal non-arbitrated protocol using a non-commutative general linear group. The developed protocol forces a hard subgroup membership search problem into a non-commutative structure. The protocol involves at first a generalized Diffie-Hellman key interchange and further on the private and public parameters are recursively updated each time a new cipher session is launched. Security is based on a hard variation of the Generalized Symmetric Decomposition Problem (GSDP). Working with GF(2518) a 64-bits security is achieved, and if GF(25116) is chosen, the security rises to 127-bits. An appealing feature is that there is no need for big number libraries as all arithmetic if performed in Z251 and therefore the new protocol is particularly useful for computational platforms with very limited capabilities like smartphones or smartcards.

3

Kryteria budowy komputera kwantowego i algorytmy kryptografii postkwantowej

Gruber J., Iwanicki D., Jacak M., Jóźwiak I., Jóźwiak P., Kowalczyk J.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2014

|

z. 74

21--32

EN

The article concise introduction to cryptography post-quantum. It explains the basic concepts related to the field. The reason for the development of cryptography is the threat posed by the possibility of building a quantum computer with high computing power. Defined the term "quantum computer". DiVincenzo criteria conditioning the possibility of constructing such a computer are discussed. Several groups of algorithms, which can be considered as resistant to attack by a quantum computer has been discussed.

PL

W artykule dokonano zwięzłego wprowadzenia do kryptografii postkwantowej. Wyjaśniono podstawowe pojęcia związane z tą dziedziną. Przyczyną rozwoju kryptografii postkwantowej jest zagrożenie wynikające z możliwości zbudowania komputera kwantowego dużej mocy. Zdefiniowano pojęcie komputera kwantowego i omówiono kryteria DiVincenzo konstrukcji takiego komputera. Przedstawiono cztery grupy algorytmów uważanych za odporne na ataki przy użyciu komputera kwantowego.