Temat: szyfrowanie - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Scalable PP-1 block cipher
Autorzy:: Bucholc, K.
Chmiel, K.
Grocholewska-Czuryło, A.
Idzikowska, E.
Janicka-Lipska, I.
Stokłosa, J.
Powiązania:: https://bibliotekanauki.pl/articles/907705.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: resistance against cryptanalysis
symmetric cipher
scalable cipher
S-box construction
error detection
szyfrowanie symetryczne
szyfrowanie skalowalne
kryptoanaliza
wykrywanie błędu
Opis:: 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 with respect to linear cryptanalysis and other attacks. PP-1's concurrent error detection is also discussed. Some processing speed test results are given and compared with those of other ciphers.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 401-411
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Improved reference image encryption methods based on 2^k correction in the integer wavelet domain
Autorzy:: Tuncer, Turker
Dogan, Sengul
Tadeusiewicz, Ryszard
Pławiak, Paweł
Powiązania:: https://bibliotekanauki.pl/articles/330196.pdf
Data publikacji:: 2019
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: visually meaningful image encryption
2k correction
discrete wavelet transform
least significant bits embedding
szyfrowanie obrazu
dyskretna transforma falkowa
metoda szyfrowania
Opis:: Many visually meaningful image encryption (VMIE) methods have been proposed in the literature using reference encryption. However, the most important problems of these methods are low visual quality and blindness. Owing to the low visual quality, the pre-encrypted image can be analyzed simply from the reference image and, in order to decrypt nonblind methods, users should use original reference images. In this paper, two novel reference image encryption methods based on the integer DWT (discrete wavelet transform) using 2^k correction are proposed. These methods are blind and have high visual quality, as well as short execution times. The main aim of the proposed methods is to solve the problem of the three VMIE methods existing in the literature. The proposed methods mainly consist of the integer DWT, pre-encrypted image embedding by kLSBs (k least significant bits) and 2^k correction. In the decryption phase, the integer DWT and preencrypted image extraction with the mod operator are used. Peak signal-to-noise ratio (PSNR) measures the performances of the proposed methods. Experimental results clearly illustrate that the proposed methods improve the visual quality of the reference image encryption methods. Overall, 2^k correction and kLSBs provide high visual quality and blindness.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 817-829
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Implications of the arithmetic ratio of prime numbers for RSA security
Autorzy:: Ivanov, Andrey
Stoianov, Nikolai
Powiązania:: https://bibliotekanauki.pl/articles/2201016.pdf
Data publikacji:: 2023
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: public key cryptography
RSA encryption
public key generation rules
kleptography
fusion of number balance
kryptografia klucza publicznego
szyfrowanie RSA
kleptografia
bilans liczbowy
Opis:: The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm problem (ECDLP). In practice, one of the most often used cryptographic algorithms continues to be the RSA. The security of RSA is based on IFP and DLP. To achieve good data security for RSA-protected encryption, it is important to follow strict rules related to key generation domains. It is essential to use sufficiently large lengths of the key, reliable generation of prime numbers and others. In this paper the importance of the arithmetic ratio of the prime numbers which create the modular number of the RSA key is presented as a new point of view. The question whether all requirements for key generation rules applied up to now are enough in order to have good levels of cybersecurity for RSA based cryptographic systems is clarified.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 57--70
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "szyfrowanie" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język