Temat: cryptography - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Lightweight cryptographic algorithm based on trigonometry, dedicated on encryption of short messages
Autorzy:: Maleszewski, Wiesław
Tematy:: IoT cryptography
lightweight cryptography
flexible cryptography; Pokaż więcej
Wydawca:: Politechnika Gdańska
Powiązania:: https://bibliotekanauki.pl/articles/23313488.pdf Link otwiera się w nowym oknie
Opis:: The IoT technology is currently used in many areas and marked by growing popularity. On the one hand, the IoT makes our lives easier, on the other hand, it presents challenges in terms of security and privacy protection. An IoT infrastructure is characterized by a high level of threats due to, inter alia, numerous technical barriers that make it difficult to use conventional methods to protect information. The aim of this paper is to present a symmetric coding algorithm based on algebraic groups generated by specific trigonometric curves. The algorithm is dedicated to short data sequences transmitted by devices with limited computing power.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography
Autorzy:: Ustimenko, V.
Wroblewska, A.
Tematy:: discrete logarithm
cryptographic algorithm
cryptography
public key cryptography; Pokaż więcej
Wydawca:: Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Powiązania:: https://bibliotekanauki.pl/articles/106218.pdf Link otwiera się w nowym oknie
Opis:: Let K be a finite commutative ring and f = f(n) a bijective polynomial map f(n) of the Cartesian power K^n onto itself of a small degree c and of a large order. Let f^y be a multiple composition of f with itself in the group of all polynomial automorphisms, of free module K^n. The discrete logarithm problem with the pseudorandom base f(n) (solvef^y = b for y) is a hard task if n is sufficiently large. We will use families of algebraic graphs defined over K and corresponding dynamical systems for the explicit constructions of such maps f(n) of a large order with c = 2 such that all nonidentical powers f^y are quadratic polynomial maps. The above mentioned result is used in the cryptographical algorithms based on the maps f(n) – in the symbolic key exchange protocols and public keys algorithms.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Lightweight compression with encryption based on asymmetric numeral systems
Autorzy:: Niemiec, Marcin
Duda, Jarosław
Opis:: Data compression combined with effective encryption is a common requirement of data storage and transmission. Low cost of these operations is often a high priority in order to increase transmission speed and reduce power usage. This requirement is crucial for battery-powered devices with limited resources, such as autonomous remote sensors or implants. Well-known and popular encryption techniques are frequently too expensive. This problem is on the increase as machine-to-machine communication and the Internet of Things are becoming a reality. Therefore, there is growing demand for finding trade-offs between security, cost and performance in lightweight cryptography. This article discusses asymmetric numeral systems- an innovative approach to entropy coding which can be used for compression with encryption. It provides a compression ratio comparable with arithmetic coding at a similar speed as Huffman coding; hence, this coding is starting to replace them in new compressors. Additionally, by perturbing its coding tables, the asymmetric numeral system makes it possible to simultaneously encrypt the encoded message at nearly no additional cost. The article introduces this approach and analyzes its security level. The basic application is reducing the number of rounds of some cipher used on ANS-compressed data, or completely removing an additional encryption layer when reaching a satisfactory protection level.
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Post-Quantum Cryptography: generalized ElGamal cipher over GF(2518)
Autorzy:: Hecht, P.
Tematy:: post-quantum cryptography
non-commutative cryptography
finite fields; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/375655.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Random number generators: algorithms, testing, applications
Autorzy:: Kotulski, Zbigniew
Tematy:: Random number generation
Applications to coding theory and cryptography
Cryptography; Pokaż więcej
Wydawca:: Polskie Towarzystwo Matematyczne
Powiązania:: https://bibliotekanauki.pl/articles/748142.pdf Link otwiera się w nowym oknie
Opis:: .
As usual in this journal, the present article is a survey paper which shows Polish readers the state-of-the-art today with the goal of stimulating them to new applications. In the paper, all essential developments in random number generation are treated and the working field of the author, cryptography, is especially mentioned. (In this field, the author has already published with others a major study [K. Górski et al., Generatory losowych ciągów binarnych w kryptografii, Warsaw, 1999; per bibl.].) Among the 70 references to the literature, naturally there are many Polish ones, which is useful for the Polish reader. After two introductory chapters on the application of random numbers and their history, in Chapter 3 the author deals with all known random number generators for uniform and arbitrary distributions, briefly also for stochastic processes. Chapter 4 is especially dedicated to the generation of random bit sequences (number-theoretic methods, shift registers, newer methods), which are of great importance in coding theory and cryptography. Ergodic and chaos theory are referred to. Finally, in Chapter 5 tests of random numbers are treated: traditional and modern ones (spectral, entropy, wavelet tests and such which are named cryptographic). The author recomends that the reader, from the immense number of tests, select a few efficient ones.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Algebraic Geometry in Cryptography
Autorzy:: Wiesław, Maleszewski
Cytata wydawnicza:: Wiesław Maleszewski, Algebraic Geometry in Cryptography, 19th International Workshop for Young Mathematicians "Algebraic Geometry", Jagiellonian University in Kraków, 2016
Opis:: The paper presents application of algebraic geometry in cryptography. In the first part we go from basic issues, among other things, such as elliptic curves, then get to know the various cryptographic systems based on elliptic curves. At the end we show some examples of applications of these methods to protect the information used in the modern world.
Dostawca treści:: Repozytorium Centrum Otwartej Nauki

Książka

na półce

Skocz do pozycji: 7.

Tytuł:: Privacy and security of data on mobile devices with Android and Windows Phone operating systems
Autorzy:: Pawłowicz, B.
Tybura, M.
Tematy:: security
mobile
steganography
cryptography; Pokaż więcej
Wydawca:: Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Powiązania:: https://bibliotekanauki.pl/articles/114652.pdf Link otwiera się w nowym oknie
Opis:: The paper focuses on three significant aspects which can improve safety of data and also increasing privacy of users using tablets and smartphones. The chosen platforms are Android and Windows Phone. The aim of the work is to develop library independent from operating system API that enables encrypting and hiding the data stored in mobile device. Also applications that demonstrate functions of the library was developed. The library will be used in securing data from NFC modules used as RFID readers.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: Digital Fingerprinting Based on Quaternion Encryption Scheme for Gray-Tone Images
Autorzy:: Czaplewski, B.
Dzwonkowski, M.
Rykaczewski, R.
Tematy:: cryptography
multimedia
security
watermarking; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/308836.pdf Link otwiera się w nowym oknie
Opis:: In this paper a new idea of digital images fingerprinting is proposed. The method is based on quaternion encryption in the Cipher Block Chaining (CBC) mode. Quaternions are hyper-complex numbers of rank 4 and thus often applied to mechanics in three-dimensional space. The encryption algorithm described in the paper is designed for graytone images but can easily be adopted for color ones. For the encryption purpose, the algorithm uses the rotation of data vectors presented as quaternions in a three-dimensional space around another quaternion (key). On the receiver's side, a small amount of unnoticeable by human eye errors occurs in the decrypted images. These errors are used as a user's digital figerprint for the purpose of traitor tracing in case of copyright violation. A computer-based simulation was performed to scrutinize the potential presented quaternion encryption scheme for the implementation of digital fingerprinting. The obtained results are shown at the end of this paper.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: Boolean feedback functions for full-length nonlinear shift registers
Autorzy:: Janicka-Lipska, I.
Stokłosa, J.
Tematy:: cryptography
shift registers
Boolean functions; Pokaż więcej
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Powiązania:: https://bibliotekanauki.pl/articles/308304.pdf Link otwiera się w nowym oknie
Opis:: In the paper a heuristic algorithm for a random generation of feedback functions for Boolean full-length shift register sequences is presented. With the help of the algorithm one can generate n-stage Boolean full-length shift register sequences for (potentially) arbitrary n ? 6. Some properties of the generated feedback functions are presented.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Hybrid cryptography with a one-time stamp to secure contact tracing for COVID-19 infection
Autorzy:: El-Douh, Ahmed Abdel-Rahim
Lu, Song Feng
Elkouny, Abdelatif A.
Amein, A.S.
Tematy:: hybrid cryptography
digital signature
RSA
AES
asymmetric cryptography
symmetric cryptography
cybersecurity
COVID-19
kryptografia hybrydowa
podpis elektroniczny
kryptografia asymetryczna
kryptografia symetryczna
cyberbezpieczeństwo; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Powiązania:: https://bibliotekanauki.pl/articles/2055157.pdf Link otwiera się w nowym oknie
Opis:: The COVID-19 pandemic changed the lives of millions of citizens worldwide in the manner they live and work to the so-called new norm in social standards. In addition to the extraordinary effects on society, the pandemic created a range of unique circumstances associated with cybercrime that also affected society and business. The anxiety due to the pandemic increased the probability of successful cyberattacks and as well as number and range. For public health officials and communities, location tracking is an essential component in the their efforts to combat the disease. The governments provide a lot of mobile apps to help health officials to trace the infected persons and contact them to aid and follow up on the health status, which requires an exchange of data in different forms. This paper presents the one-time stamp model as a new cryptography technique to secure different contact forms and protect the privacy of the infected person. The one-time stamp hybrid model consists of a combination of symmetric, asymmetric, and hashing cryptography in an entirely new way that is different from conventional and similar existing algorithms. Several experiments have been carried out to analyze and examine the proposed technique. Also, a comparison study has been made between our proposed technique and other state-of-the-art alternatives. Results show that the proposed one-time stamp model provides a high level of security for the encryption of sensitive data relative to other similar techniques with no extra computational cost besides faster processing time.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "cryptography" wg kryterium: Temat