Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "encryption, decryption" wg kryterium: Wszystkie pola


Wyświetlanie 1-5 z 5
Tytuł:
Projective and Affine Transformations in the Modification of RSA Algorithm for Detached Classes of Images
Autorzy:
Rashkevych, Y. Y.
Peleshko, D. D.
Kovalchuk, A. M.
Szymanski, Z.
Powiązania:
https://bibliotekanauki.pl/articles/108658.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
RSA algorithm
encryption, decryption
affine transformation
projective transformation
Opis:
Based on the RSA algorithm, as the most common industrial standard of data encryption, modifications with projective and affine transformations for encryption of images that allow to strictly allocate outlines are proposed.
Źródło:
Journal of Applied Computer Science Methods; 2011, 3 No. 1; 67-75
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Hybrid CPU/GPU Cluster for Encryption and Decryption of Large Amounts of Data
Autorzy:
Niewiadomska-Szynkiewicz, E.
Marks, M.
Jantura, J.
Podbielski, M.
Powiązania:
https://bibliotekanauki.pl/articles/309363.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
AES
computer clusters
cryptography
DES
GPU computing
parallel calculation
software systems
Opis:
The main advantage of a distributed computing system over standalone computer is an ability to share the workload between cores, processors and computers. In our paper we present a hybrid cluster system - a novel computing architecture with multi-core CPUs working together with many-core GPUs. It integrates two types of CPU, i.e., Intel and AMD processor with advanced graphics processing units, adequately, Nvidia Tesla and AMD FirePro (formerly ATI). Our CPU/GPU cluster is dedicated to perform massive parallel computations which is a common approach in cryptanalysis and cryptography. The efficiency of parallel implementations of selected data encryption and decryption algorithms are presented to illustrate the performance of our system.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 3; 32-39
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Attribute-Based Encryption Method Using Outsourced Decryption and Hierarchical Access Structure
Autorzy:
Mujawar, Tabassum N.
Bhajantri, Lokesh B.
Powiązania:
https://bibliotekanauki.pl/articles/2142312.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
cloud computing
CPABE
hierarchical access structure
Opis:
Cloud computing is being rapidly adopted by many organizations from different domains and large amounts of data is stored in the cloud. In order to ensure data security, the attribute-based access control mechanism has been emerging recently as a fine-grained access control model that grants access based on the data user’s attributes. In this model, the data owner builds the access policy using the attributes of the data users and access to the data is granted only if the requirements of such an access policy are satisfied. Ciphertext policy-based attribute-based encryption (CPABE) is one of the most widely used methods for providing encrypted access control. Complex, time consuming and costly paring operations are the major issue with the CPABE method. Hence, another efficient method is needed to reduce the data user’s overhead while decrypting data. This paper presents an efficient method consisting in outsourcing decryption operations to a third-party server, so that complex operations may be performed by that machine with only some simple calculations left on the data user’s side. The concept of a hierarchical access structure is also integrated with the traditional CPABE technique. The hierarchical approach enables the data owner to encrypt multiple data using a single common hierarchical access structure. This allows the user to decrypt only the relevant part of ciphertext, depending on which fragment of the hierarchical access structure is satisfied. The paper evaluates also the performance of the proposed model in terms of time and storage cost.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 2; 75--81
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Program for Simulation and Testing of Apply Cryptography of Advance Encryption Standard (AES) Algorithm with Rivest-Shamir-Adleman (RSA) Algorithm for Good Performance
Autorzy:
Pattanavichai, Santi
Powiązania:
https://bibliotekanauki.pl/articles/2124746.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
information security management systems
ISMS
cryptography
encryption
decryption
advanced encryption standard
AES
Rivest-Shamir-Adleman
RSA
Opis:
Nowadays, information security management systems are important parts of managing a system for better handling of the information security. In scenarios and situations where safety management is done by managing protection of malwares, it is important to manage security issues properly. Cryptography is an approach which makes possible for a recipient to encrypt and decrypt the information. A combination of two different strategies for encryption and decryption in the text encoding will be transformed into the used all content. The encryption and decryption key of the content decryption key is used. There are different types of information. A number, such as finding two large prime numbers with that product. The number, the size of the RSA key is large enough to make, it's hard to pinpoint these numbers. The key, known as the RSA public key, is the most prominent open encryption. Calculations were used for information exchange. In this paper, we created a program for simulation and testing of apply cryptography of Advance Encryption Standard (AES) algorithm with Rivest-Shamir-Adleman (RSA) algorithm for better performance. In this study, this program is an application of a new algorithm to be the AES&RSA principle of using a public key instead of a private key for cryptography, and the testing of encryption and decryption for the AES&RSA algorithm resulted in time is no different on the AES algorithm and more secure encryption and decryption. The results indicated that the time needed for encoding and decoding of AES&RSA algorithm has been reduced (i.e., efficiency has been improved).
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 3; 475--481
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reversible data-hiding-through-encryption scheme using rotated stream cipher
Autorzy:
Manikandan, V. M.
Powiązania:
https://bibliotekanauki.pl/articles/2097957.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
reversible data-hiding
image encryption
image decryption
secure message transmission
Opis:
Research into the domain of reversible data-hiding has received a great deal of attention in recent years due to its wide applications in medical image transmission and cloud computing. Reversible data-hiding during image encryption is a recently emerged framework for hiding secret data in an image during the image-encryption process. In this manuscript, we propose a new reversible data-hiding-through-encryption scheme that will ensure a high embedding rate without bringing any additional overhead of key handling. The proposed algorithm can use any secure symmetric encryption scheme, and the encryption and/or decryption key should be shared with the receiver for data extraction and image recovery. As per the proposed scheme, the data hider can hide threebits of a secret message in an image block of a size of B × B pixels. The data extraction and image recovery will be carried out by analyzing the closeness between adjacent pixels. The simulation of the new scheme carried out on the USC-SIPI dataset shows that the proposed scheme outperforms the well-known existing schemes in terms of embedding rates and bit error rates.
Źródło:
Computer Science; 2021, 22 (2); 267-291
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies