2024-03-29T07:51:04Z
http://ijet.pl/index.php/ijet/oai
oai:ojs.ijet.ise.pw.edu.pl:article/3224
2021-05-11T08:41:30Z
ijet:CRYPTO
Cryptographically Strong Elliptic Curves of Prime Order
Szmidt, Janusz
Gliwa, Rafał
Barański, Marcin
Mersenne primes; elliptic curves; security requirements; searching algorithm; Magma
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves.We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
Electronics and Telecommunications Committee
2021-05-11
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135966
International Journal of Electronics and Telecommunications; Vol 67, No 2 (2021); 207-212
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135966/803
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135966/2706
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135966/2707
Copyright (c) 2021 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2566
2020-09-10T21:07:46Z
ijet:CRYPTO
Using SAT solvers to finding short cycles in cryptographic algorithms
Dudzic, Władysław
Kanciak, Krzysztof
A desirable property of iterated cryptographic algorithms, such as stream ciphers or pseudo-random generators, is the lack of short cycles. Many of the previously mentioned algorithms are based on the use of linear feedback shift registers (LFSR) and nonlinear feedback shift registers (NLFSR) and their combination. It is currently known how to construct LFSR to generate a bit sequence with a maximum period, but there is no such knowledge in the case of NLFSR. The latter would be useful in cryptography application (to have a few taps and relatively low algebraic degree). In this article, we propose a simple method based on the generation of algebraic equations to describe iterated cryptographic algorithms and find their solutions using an SAT solver to exclude short cycles in algorithms such as stream ciphers or nonlinear feedback shift register (NLFSR). Thanks to the use of AIG graphs, it is also possible to fully automate our algorithm, and the results of its operation are comparable to the results obtained by manual generation of equations. We present also the results of experiments in which we successfully found short cycles in the NLFSRs used in KSG, Grain-80, Grain-128 and Grain-128a stream ciphers and also in stream ciphers Bivium and Trivium (without constants used in the initialization step).
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131897
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 443-448
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131897/717
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131897/2015
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131897/2016
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131897/2017
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1320
2018-04-27T08:36:48Z
ijet:CRYPTO
Improving security of lightweith SHA-3 against preimage attacks
Onopa, Serhii
Kotulski, Zbigniew
hash function, SHA-3, Keccak, preimage attack, lightweight cryptography
In this article we describe the SHA-3 algorithm and its internal permutation in which potential weaknesses are hidden. The hash algorithm can be used for different purposes, such as pseudo-random bit sequences generator, key wrapping or one pass authentication, especially in weak devices (WSN, IoT, etc.). Analysis of the function showed that successful preimage attacks are possible for low round hashes, protection from which only works with increasing the number of rounds inside the function. When the hash function is used for building lightweight applications, it is necessary to apply a small number of rounds, which requires additional security measures. This article proposes a variant improved hash function protecting against preimage attacks, which occur on SHA-3. We suggest using an additional external randomness sources obtained from a lightweight PRNG or from application of the source data permutation.
Electronics and Telecommunications Committee
Serhii Onopa and Zbigniew Kotulski are with Warsaw University of Technology, (pl. Politechniki 1, 00-661, Warsaw, Poland) (e-mail: zkotulsk@tele.pw.edu.pl, 2322314@gmail.com)
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119364
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 159-166
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119364/453
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3548
2022-08-27T21:26:15Z
ijet:CRYPTO
Program for Simulation and Testing of Apply Cryptography of Advance Encryption Standard (AES) Algorithm with Rivest-Shamir-Adleman (RSA) Algorithm for Good Performance
Pattanavichai, Santi
Tnformation Technology Department
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).
Electronics and Telecommunications Committee
Rajamangala University of Technology Thanyaburi, RMUTT
2022-08-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.141263
International Journal of Electronics and Telecommunications; Vol 68, No 3 (2022); 475-481
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.141263/987
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141263/3164
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141263/3503
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141263/3507
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141263/3512
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141263/3513
Copyright (c) 2022 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2912
2020-11-22T18:22:53Z
ijet:CRYPTO
Differential cryptanalysis of new Qamal encryption algorithm
Algazy, Kunbolat
Babenko, Ludmila
Biyashev, Rustem
Ishchukova, Evgeniya
Romaniuk, Ryszard
Kapalova, Nursulu
Smolarz, Andrzej
Nysynbaeva, Saule
Currently, the Republic of Kazakhstan is developing a new standard for symmetric data encryption. One of the candidates for the role of the standard is the Qamal encryption algorithm developed by the Institute of Information and Computer Technologies (Almaty, Republic of Kazakhstan). The article describes the algorithm. Differential properties of the main operations that make up the Qamal cypher are considered in the questions of stability. We have shown that for a version with a 128-bit data block and the same secret key size for three rounds of encryption it is difficult to find the right pairs of texts with a probability of 2–120, which makes differential cryptanalysis not applicable to the Qamal cypher
Electronics and Telecommunications Committee
2020-11-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.134023
International Journal of Electronics and Telecommunications; Vol 66, No 4 (2020); 647-653
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.134023/745
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134023/2381
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134023/2528
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1764
2019-05-19T20:23:16Z
ijet:CRYPTO
Combined small subgroups and side-channel attack on elliptic curves with cofactor divisible by $2^m$
Wroński, Michał Jakub
Nowadays, alternative models of elliptic curves like Montgomery, Edwards, twisted Edwards, Hessian, twisted Hessian, Huff's curves and many others are very popular and many people use them in cryptosystems which are based on elliptic curve cryptography. Most of these models allow to use fast and complete arithmetic which is especially convenient in fast implementations that are side-channel attacks resistant. Montgomery, Edwards and twisted Edwards curves have always order of group of rational points divisible by 4. Huff's curves have always order of rational points divisible by 8. Moreover, sometimes to get fast and efficient implementations one can choose elliptic curve with even bigger cofactor, for example 16. Of course the bigger cofactor is, the smaller is the security of cryptosystem which uses such elliptic curve. In this article will be checked what influence on the security has form of cofactor of elliptic curve and will be showed that in some situations elliptic curves with cofactor divisible by $2^m$ are vulnerable for combined small subgroups and side-channel attacks.
Electronics and Telecommunications Committee
2019-05-19
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2019.126302
International Journal of Electronics and Telecommunications; Vol 65, No 2 (2019); 203-209
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2019.126302/542
Copyright (c) 2019 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1154
2018-04-27T08:36:48Z
ijet:CRYPTO
Phase-shift Fault Analysis of Grain v1
Hromada, Viliam
Petho, Tibor
Cryptography
This paper deals with the phase-shift fault analysisof stream cipher Grain v1. We assume that the attacker is ableto desynchronize the linear and nonlinear registers of the cipherduring the keystream generation phase by either forcing one ofthe registers to clock one more time, while the other register is notclocked, or by preventing one of the registers from clocking, whilethe other register is clocked. Using this technique, we are able toobtain the full inner state of the cipher in reasonable time (under12 hours on a single PC) by using 150 bits of unfaulted keystream,600 bits of faulted keystreams and by correctly guessing 28 bitsof the linear register.
Electronics and Telecommunications Committee
Scientific Grant Agency VEGA, The Ministry of Education, Science, Research and Sport of the Slovak Republic, Slovakia
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119360
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 131-136
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119360/448
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3471
2021-12-19T22:59:18Z
ijet:CRYPTO
Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model
Jurkiewicz, Mariusz
Cryptography; Public Key Cryptography; Provable Group Based Schemes; Digital Signature Schemes
In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over $E(\FF_{q^{n}})[p]\times E(\FF_{q^{nk}})[p]\to \FF_{q^{nk}}[p]$. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in \fucma~security model by reducing the security of the scheme to the computational hardness of solving the Weak $\ell$-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
Electronics and Telecommunications Committee
2021-12-01
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.137868
International Journal of Electronics and Telecommunications; Vol 67, No 4 (2021); 717-726
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.137868/913
Copyright (c) 2021 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2568
2020-09-10T21:07:46Z
ijet:CRYPTO
Towards an auditable cryptographic access control to high-value sensitive data
Kanciak, Krzysztof
Wrona, Konrad
cryptography
We discuss the challenge of achieving an auditable key management for cryptographic access control to high-value sensitive data. In such settings it is important to be able to audit the key management process - and in particular to be able to provide verifiable proofs of key generation. The auditable key management has several possible use cases in both civilian and military world. In particular, the new regulations for protection of sensitive personal data, such as GDPR, introduce strict requirements for handling of personal data and apply a very restrictive definition of what can be considered a personal data. Cryptographic access control for personal data has a potential to become extremely important for preserving industrial ability to innovate, while protecting subject's privacy, especially in the context of widely deployed modern monitoring, tracking and profiling capabilities, that are used by both governmental institutions and high-tech companies. However, in general, an encrypted data is still considered as personal under GDPR and therefore cannot be, e.g., stored or processed in a public cloud or distributed ledger. In our work we propose an identity-based cryptographic framework that ensures confidentiality, availability, integrity of data while potentially remaining compliant with the GDPR framework.
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131898
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 449-458
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131898/718
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1288
2018-04-27T08:36:48Z
ijet:CRYPTO
Scalable method of searching for full-period Nonlinear Feedback Shift Registers with GPGPU. New List of Maximum Period NLFSRs.
Kanciak, Krzysztof
Augustynowicz, Paweł
crypto
This paper addresses the problem of efficient searching for Nonlinear Feedback Shift Registers (NLFSRs) with a guaranteed full period. The maximum possible period for an $n$-bit NLFSR is $2^n-1$ (all-zero state is omitted). %but omitting all-0 state makes the period $2^n-1$ in their longest cycle of states. A multi-stages hybrid algorithm which utilizes Graphics Processor Units (GPU) power was developed for processing data-parallel throughput computation.Usage of abovementioned algorithm allows to give an extended list of n-bit NLFSR with maximum period for 7 cryptographically applicable types of feedback functions.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119365
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 167-171
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119365/454
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119365/1048
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119365/1114
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3919
2022-11-30T22:59:34Z
ijet:CRYPTO
The High-Level Practical Overview of Open-Source Privacy-Preserving Machine Learning Solutions
Kuźniewski, Konrad
Matusiewicz, Krystian
Sapiecha, Piotr
Privacy-Preserving Machine Learning; Homomorphic Encryption; Secure Multi Party Computation; Trusted Execution Environment
This paper aims to provide a high-level overview of practical approaches to machine-learning respecting the privacy and confidentiality of customer information, which is called Privacy-Preserving Machine Learning. First, the security approaches in offline-learning privacy methods are assessed. Those focused on modern cryptographic methods, such as Homomorphic Encryption and Secure Multi-Party Computation, as well as on dedicated combined hardware and software platforms like Trusted Execution Environment - Intel® Software Guard Extensions (Intel® SGX). Combining the security approaches with different machine learning architectures leads to our Proof of Concept in which the accuracy and speed of the security solutions will be examined. The next step was exploring and comparing the Open-Source Python-based solutions for PPML. Four solutions were selected from almost 40 separate, state-of-the-art systems: SyMPC, TF-Encrypted, TenSEAL, and Gramine. Three different Neural Network architectures were designed to show different libraries’ capabilities. The POC solves the image classification problem based on the MNIST dataset. As the computational results show, the accuracy of all considered secure approaches is similar. The maximum difference between non-secure and secure flow does not exceed 1.2%. In terms of secure computations, the most effective Privacy-Preserving Machine Learning library is based on Trusted Execution Environment, followed by Secure Multi-Party Computation and Homomorphic Encryption. However, most of those are at least 1000 times slower than the non-secure evaluation. Unfortunately, it is not acceptable for a real-world scenario. Future work could combine different security approaches, explore other new and existing state-of-the-art libraries or implement support for hardware-accelerated secure computation.
Electronics and Telecommunications Committee
2022-11-30
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.143880
International Journal of Electronics and Telecommunications; Vol 68, No 4 (2022); 741-747
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.143880/1022
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.143880/3747
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.143880/3748
Copyright (c) 2022 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2910
2021-01-31T00:11:06Z
ijet:CRYPTO
Development and analysis of symmetric encryption algorithm Qamal based on a substitution-permutation network
Biyashev, Rustem G.
Kapalova, Nursulu A.
Dyusenbayev, Dilmuhanbet S.
Algazy, Kunbolat T.
Wójcik, waldemar
Smolarz, Andrzej
This paper represents a developed cryptographic information protection algorithm based on an substitution-permutation network. We describe the cryptographic transformations used in the developed algorithm. One of the features of the algorithm is the simplicity of its modification with regard to different security levels. The algorithm uses a pre-developed S-box tested against differential and linear cryptanalysis. The S-box is consistent with the one of known standards AES and GOST R 34.12-2015. We provide the findings of an avalanche-effect investigation and statistical properties of cipher texts. The algorithm actually meets the avalanche-effect criterion even after the first round.
Electronics and Telecommunications Committee
Institute of Information and Computer Technologies
2021-01-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135954
International Journal of Electronics and Telecommunications; Vol 67, No 1 (2021); 127-132
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135954/788
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135954/2379
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135954/2380
Copyright (c) 2021 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1917
2019-05-19T20:23:16Z
ijet:CRYPTO
Security Assurance in DevOps Methodologies and Related Environments
Siewruk, Grzegorz
Mazurczyk, Wojciech
Karpiński, Andrzej
The biggest software development companies conduct daily more than hundreds deployments which influence currently operating IT (Information Technology) systems. This is possible due to the availability of automatic mechanisms which are providing their functional testing and later applications deployment. Unfortunately, nowadays, there are no tools or even a set of good practices related to the problem on how to include IT security issues into the whole production and deployment processes. This paper describes how to deal with this problem in the large mobile telecommunication operator environment.
Electronics and Telecommunications Committee
2019-05-19
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2019.126303
International Journal of Electronics and Telecommunications; Vol 65, No 2 (2019); 211-216
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2019.126303/543
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2019.126303/1500
Copyright (c) 2019 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1157
2018-04-27T08:36:48Z
ijet:CRYPTO
Tabu search against permutation based stream ciphers
Polak, Iwona
Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 2^52 internal states for RC4 and 2^180 for VMPC.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119361
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 137-145
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119361/449
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/930
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/931
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/932
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/933
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/934
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/935
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119361/973
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3581
2022-03-08T12:08:26Z
ijet:CRYPTO
Analysis of the possibility of using selected hash functions submitted for the SHA-3 competition in the SDEx encryption method
Hłobaż, Artur Jan
Informatyka; informatyka techniczna i telekomunikacja
The paper presents analysis of the possibility of using selected hash functions submitted for the SHA-3 competition in the SDEx encryption method. The group of these functions will include the finalists of the SHA-3 competition, i.e. BLAKE, Grøstl, JH, Keccak, Skein. The aim of the analysis is to develop more secure and faster cryptographic algorithm compared to the current version of the SDEx method with SHA-512 and the AES algorithm. When considering the speed of algorithms, mainly the software implementation will be taken into account, as it is the most commonly used.
Electronics and Telecommunications Committee
Polish National Science Centre
2022-02-26
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.139848
International Journal of Electronics and Telecommunications; Vol 68, No 1 (2022); 57-62
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.139848/927
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.139848/3251
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.139848/3252
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.139848/3253
Copyright (c) 2022 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2571
2020-09-10T21:07:46Z
ijet:CRYPTO
Simple verification of completeness of two addition formulas on twisted Edwards curves
Dryło, Robert
Kijko, Tomasz
mathematics, algebraic geometry, cryptography
Daniel Bernstein and Tanja Lange proved thattwo given addition formulas on twisted Edwards elliptic curvesax^2 + y^2 = 1 + dxy are complete (i.e. the sum of any two pointson a curve can be computed using one of these formulas). Inthis paper we give other simple verification of completenessof these formulas using for example Groebner bases and an ¨algorithm implemented in Magma, which is based on the fact thatcompleteness means that some systems of polynomial equationshave no solutions. This method may be also applied to verifycompleteness of additions formulas on other models of ellipticcurves.
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131899
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 459-464
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131899/719
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131899/2113
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1289
2018-04-27T08:36:48Z
ijet:CRYPTO
Block cipher based Public Key Encryption viaIndistinguishability Obfuscation
Horubała, Aleksandra
Andrzejczak, Michał
Sapiecha, Piotr
Waszkiewicz, Daniel
Cryptography
The article is devoted to generation techniques of thenew public key crypto-systems, which are based on applicationof indistinguishability obfuscation methods to selected privatekey crypto-systems. The techniques are applied to symmetrickey crypto-system and the target system is asymmetric one.As an input for our approach an implementation of symmetricblock cipher with a given private-key is considered. Differentobfuscation methods are subjected to processing. The targetsystem would be treated as a public-key for newly createdpublic crypto-system. The approach seems to be interestingfrom theoretical point of view. Moreover, it can be useful forinformation protection in a cloud-computing model.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119366
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 173-178
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119366/455
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/4116
2023-05-18T20:31:22Z
ijet:CRYPTO
Energy saving chaotic sequence based encryption, authentication and hashing for M2M communication of IoT device
Kościug, Bartosz
Bilski, Piotr
In this paper, the secure low-power Internet of Things (IoT) transmission methods for encryption and digital signature are presented. The main goal was to develop energy-efficient method to provide IoT devices with data confidentiality, integrity, and authenticity. The cryptograph energy efficient and security algorithms modifications for IoT domain were made. The novelty in our solution is the usage of encryption method popular in the image processing in the domain of the Internet of Things. Proposed modification improves immunity for the brute-force and plain-text attacks. Furthermore, we propose the modifications for hash calculation method to transform it into digital signature calculation method that is very sensitive to input parameters. The results indicate low energy consumption of both methods, however it varies significantly depending on the architecture of the devices.
Electronics and Telecommunications Committee
2023-05-18
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.144358
International Journal of Electronics and Telecommunications; Vol 69, No 2 (2023); 253-259
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.144358/1089
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.144358/3964
Copyright (c) 2023 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3160
2021-05-11T08:41:30Z
ijet:CRYPTO
Arithmetic using compression on elliptic curves in Huff's form and its applications
Dryło, Robert
Kijko, Tomasz
Wroński, Michał Jakub
Cryptography; Elliptic curve cryptography
In this paper for elliptic curves provided by Huff's equation $H_{a,b}: ax(y^2-1) = by(x^2-1)$ and general Huff's equation $G_{\overline{a},\overline{b}}\ :\ {\overline{x}}(\overline{a}{\overline{y}}^2-1)={\overline{y}}(\overline{b}{\overline{x}}^2-1)$ and degree 2 compression function $f(x,y) = xy$ on these curves, herein we provide formulas for doubling and differential addition after compression, which for Huff's curves are as efficient as Montgomery's formulas for Montgomery's curves $By^2 = x^3 + Ax^2 + x$. For these curves we also provided point recovery formulas after compression, which for a point $P$ on these curves allows to compute $[n]f(P)$ after compression using the Montgomery ladder algorithm, and then recover $[n]P$. Using formulas of Moody and Shumow for computing odd degree isogenies on general Huff's curves, we have also provide formulas for computing odd degree isogenies after compression for these curves.Moreover, it is shown herein how to apply obtained formulas using compression to the ECM algorithm. In the appendix, we present examples of Huff's curves convenient for the isogeny-based cryptography, where compression can be used.
Electronics and Telecommunications Committee
2021-05-11
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135964
International Journal of Electronics and Telecommunications; Vol 67, No 2 (2021); 193-200
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135964/801
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135964/2626
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135964/2627
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135964/2628
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135964/2629
Copyright (c) 2021 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2545
2020-09-10T21:07:45Z
ijet:CRYPTO
SIDH hybrid schemes with a classical component based on the discrete logarithm problem over finite field extension
Wroński, Michał Jakub
Burek, Elżbieta
Dzierzkowski, Łukasz
Cryptography
The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over $\Fpn$, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields $\Fp, \Fpd, \Fpc, \Fps$ and $\Fpo$, for primes $p$ used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131896
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 431-441
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131896/716
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131896/1985
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131896/1986
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131896/1987
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1155
2018-04-27T08:36:48Z
ijet:CRYPTO
Finding Differential Paths in ARX Ciphers through Nested Monte-Carlo Search
Dwivedi, Ashutosh Dhar
Morawiecki, Paweł
Wójtowicz, Sebastian
We propose the adaptation of Nested Monte-Carlo Search algorithm for finding differential trails in the class of ARX ciphers. The practical application of the algorithm is demonstrated on round-reduced variants of block ciphers from the SPECK family. More specifically, we report the best differential trails,up to 9 rounds, for SPECK32.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119362
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 147-150
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119362/450
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3704
2022-08-27T21:26:15Z
ijet:CRYPTO
How to compute an isogeny on the extended Jacobi quartic curves?
Dzierzkowski, Łukasz
Wroński, Michał
information and communication technology
Computing isogenies between elliptic curves is a significantpart of post-quantum cryptography with many practicalapplications (for example, in SIDH, SIKE, B-SIDH, or CSIDHalgorithms). Comparing to other post-quantum algorithms, themain advantages of these protocols are smaller keys, the similaridea as in the ECDH, and a large basis of expertise aboutelliptic curves. The main disadvantage of the isogeny-basedcryptosystems is their computational efficiency - they are slowerthan other post-quantum algorithms (e.g., lattice-based). That iswhy so much effort has been put into improving the hithertoknown methods of computing isogenies between elliptic curves.In this paper, we present new formulas for computing isogeniesbetween elliptic curves in the extended Jacobi quartic formwith two methods: by transforming such curves into the shortWeierstrass model, computing an isogeny in this form and thentransforming back into an initial model or by computing anisogeny directly between two extended Jacobi quartics.
Electronics and Telecommunications Committee
2022-08-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.139890
International Journal of Electronics and Telecommunications; Vol 68, No 3 (2022); 463-468
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.139890/984
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.139890/3339
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.139890/3341
Copyright (c) 2022 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2564
2020-09-10T21:07:47Z
ijet:CRYPTO
Optimal strategies for computation of degree $\ell^n$ isogenies for SIDH
Wroński, Michał Jakub
Chojnacki, Andrzej Bolesław
Cryptography; Discrete Mathematics; Algorithms Complexity
This article presents methods and algorithms for the computation of isogenies of degree $\ell^n$. Some of these methods are obtained using recurrence equations and generating functions. A standard multiplication based algorithm for computation of isogeny of degree $\ell^n$ has time complexity equal to $O(n^2 M \left(n \log{n} \right) )$, where $M(N)$ denotes the cost of integers of size $N$ multiplication. The memory complexity of this algorithm is equal to $O\left( n \log{\left( n \log{(n)} \right)} \right)$. In this article are presented algorithms for:\begin{itemize}\item determination of optimal strategy for computation of degree $\ell^n$ isogeny,\item determination of cost of optimal strategy of computation of $\ell^n$ isogeny using solutions of recurrence equations,\item determination of cost of optimal strategy of computation of $\ell^n$ isogeny using recurrence equations,\end{itemize}where optimality in this context means that, for the given parameters, no other strategy exists that requires fewer operations for faster computation of isogeny. Also this article presents a method using generating functions for obtaining the solutions of sequences $\left( u_m \right)$ and $\left( c_m \right)$ where $c_m$ denotes the cost of computations of isogeny of degree $\ell^{u_m}$ computations for given costs $p,q$ of $\ell$-isogeny computation and $\ell$-isogeny evaluation. These solutions are also used in the construction of the algorithms presented in this article.
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131900
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 465-472
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131900/720
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131900/2012
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131900/2014
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1290
2018-04-27T08:36:48Z
ijet:CRYPTO
Confidential greedy graph algorithm
Waszkiewicz, Daniel
Horubała, Aleksandra
Sapiecha, Piotr
Andrzejczak, Michał
Cryptography
Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing. Security of~our solution is based on fully homomorphic encryption scheme. The time complexity and the security aspects of considered algorithm are described.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119367
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 179-183
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119367/456
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/4162
2023-05-18T20:31:22Z
ijet:CRYPTO
Optimal SAT solver synthesis of quantum circuits representing cryptographic nonlinear functions
Jagielski, Adam Stanisław
Cryptography; Quantum Information Theory
In this article we present a procedure that allowsto synthesize optimal circuit representing any reversible functionwithin reasonable size limits. The procedure allows to chooseeither theNCTor theMCTgate set and specify any number ofancillary qubits to be used in the circuit. We will explore efficacyof this procedure by synthesizing various sources of nonlinearityused in contemporary symmetric ciphers and draw conclusionsabout properties of those transformations in quantum setting. Inparticular we will try to synthesize optimal circuit representingASCON cipher SBOX which recently won NIST competition forLightweight Cryptography standard.
Electronics and Telecommunications Committee
2023-05-18
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.144359
International Journal of Electronics and Telecommunications; Vol 69, No 2 (2023); 261-267
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.144359/1090
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.144359/4002
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.144359/4003
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.144359/4004
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.144359/4005
Copyright (c) 2023 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/208
2015-07-31T22:49:45Z
ijet:CRYPTO
A Random Number Generator Using Ring Oscillators and SHA-256 as Post-Processing
Łoza, Szymon
Matuszewski, Łukasz
Jessa, Mieczysław
random numbers, cryptography, ring oscillators, hash functions, field-programmable gate arrays
Today, cryptographic security depends primarily on having strong keys and keeping them secret. The keys should be produced by a reliable and robust to external manipulations generators of random numbers. To hamper different attacks, the generators should be implemented in the same chip as a cryptographic system using random numbers. It forces a designer to create a random number generator purely digitally. Unfortunately, the obtained sequences are biased and do not pass many statistical tests. Therefore an output of the random number generator has to be subjected to a transformation called post-processing. In this paper the hash function SHA-256 as post-processing of bits produced by a combined random bit generator using jitter observed in ring oscillators (ROs) is proposed. All components – the random number generator and the SHA-256, are implemented in a single Field Programmable Gate Array (FPGA). We expect that the proposed solution, implemented in the same FPGA together with a cryptographic system, is more attack-resistant owing to many sources of randomness with significantly different nominal frequencies.
Electronics and Telecommunications Committee
2015-06-10
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/0.1515-eletel-2015-0026
International Journal of Electronics and Telecommunications; Vol 61, No 2 (2015); 199-204
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/0.1515-eletel-2015-0026/123
oai:ojs.ijet.ise.pw.edu.pl:article/3222
2021-05-11T08:41:30Z
ijet:CRYPTO
ID-based, proxy, threshold signature scheme
Pomykała, Jacek
Kułakowski, Henryk
Sapiecha, Piotr Krzysztof
Grela, Błażej
Cryptography
We propose the proxy threshold signature scheme with the application of elegant construction of verifiable delegating key in the ID-based infrastructure, and also with the bilinear pairings. The protocol satisfies the classical security requirements used in the proxy delegation of signing rights. The description of the system architecture and the possible application of the protocol in edge computing designs is enclosed.
Electronics and Telecommunications Committee
This article was prepared as part of the work carried out in the following two projects: CYBER-MAZOWSZE/0057/19 and DUKAT-POIR.01.01.01-00-0756/18
2021-05-11
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135965
International Journal of Electronics and Telecommunications; Vol 67, No 2 (2021); 201-205
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2021.135965/802
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135965/2702
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135965/2703
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135965/2715
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2021.135965/2716
Copyright (c) 2021 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2595
2020-11-22T18:22:53Z
ijet:CRYPTO
Integer Matrix Keys for Secure Data Aggregation in Clustered Wireless Sensor Networks
Chethana, G.
Padmaja, K.V.
Electronics and communication,Cryptography,WSN
Providing Privacy and security for aggregated data in wireless sensor networks has drawn the attention of practicing engineers and researchers globally. Several cryptographic methods have been already proposed to solve security and data integrity problems for aggregated data. Matrix cryptography is a better option for creating secure encryption/decryption algorithms to counter quantum attack. However, these algorithms have higher computational cost and increased communication overhead. Hence, a new technique of loss-less secure data aggregation in Clustered Wireless Sensor Networks is presented. The proposed method uses integer matrices as keys for data security and data integrity. Matrix operations are carried out in finite field Zp. Loss-less secure data aggregation is extended for homomorphic summation while the cipher text expansion ratio is kept substantially low. The proposed algorithm has inbuilt fast and efficient signature verification facility. The execution time of our signature verification mechanism is found to be approximately 50 percent less compared to a couple of standard existing signature verification schemes.
Electronics and Telecommunications Committee
2020-11-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.134022
International Journal of Electronics and Telecommunications; Vol 66, No 4 (2020); 637-645
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.134022/744
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134022/2074
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134022/2075
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134022/2410
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.134022/2411
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1159
2018-04-27T08:36:48Z
ijet:CRYPTO
PixSel: Images as Book Cipher Keys
Shumay, Mykel
Srivastava, Gautam
Cryptography
In this paper we introduce a novel encryption technique, which we call PixSel. This technique uses images in place of literature as the book cipher's key. Conventional book ciphers possess an unwieldy ciphertext enlargement, creating ciphertexts multiple times the length of the plaintext. As well, there is often the issue of a given book not containing the necessary material for the encipherment of some plaintexts. We sought to rectify these nuisances with PixSel, possessing a typical ciphertext enlargement of merely 1% to 20% for text. Using PixSel, there are also no limitations on encipherable data type, given a suitable image.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119363
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 151-158
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119363/452
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/3648
2022-08-27T21:26:15Z
ijet:CRYPTO
Secure And Efficient Encryption Scheme Based on Bilinear Mapping
Verma, Vandani
Mishra, Pragya
CRYPTOGRAPHY; NETWORK SECURITY
With the increasing uses of internet technologies in daily life, vulnerability of personal data/information is also increasing. Performing secure communication over the channel which is insecure has always been a problem because of speedy development of various technologies. Encryption scheme provides secrecy to data by enabling only authorized user to access it. In the proposed paper, we present an encryption algorithm designed for data security based on bilinear mapping and prove it secure by providing its security theoretical proof against adaptive chosen cipher-text attack. With the help of a lemma, we have shown that no polynomially bounded adversary has non-negligible advantage in the challenging game. We also give the comparative analysis of the proposed scheme in terms of security and performance with Deng et al., 2020 and Jiang et al., 2021 schemes and prove that proposed algorithm is more efficient and secure than others existing in literature against adaptive chosen cipher-text attack
Electronics and Telecommunications Committee
2022-08-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.141262
International Journal of Electronics and Telecommunications; Vol 68, No 3 (2022); 469-473
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2022.141262/986
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2022.141262/3262
Copyright (c) 2022 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/2559
2020-09-10T21:07:47Z
ijet:CRYPTO
Improving security of existentially unforgeable signature schemes
Jurkiewicz, Mariusz
Cryptography; Digital Signature Schemes
In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.
Electronics and Telecommunications Committee
2020-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131901
International Journal of Electronics and Telecommunications; Vol 66, No 3 (2020); 473-480
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2020.131901/721
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131901/2007
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2020.131901/2008
Copyright (c) 2020 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1358
2018-04-27T08:36:48Z
ijet:CRYPTO
A first Catalgorithm ?
Geneste, Jean-François
Cryptology; Noncommutative Rings
We propose building a new PKC in a ring structure, the classification of rings being an open problem. The difficulty of the scheme is based on retrieving the eigenvalues of endomorphism on a finite type module over a non-commutative ring. It is resistant to a chosen cipher text attack. Working in the fraction ring of a non-commutative ring makes our scheme a zero-knowledge proof of knowledge, result indistinguishable, in the Naor-Yung model. Finally, a dramatic improvement in security is obtained through the drawing with uniform probability of the working ring at high frequency.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119368
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 185-188
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119368/457
Copyright (c) 2018 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/4340
2023-10-28T09:18:15Z
ijet:CRYPTO
RSA Keys Quality in a Real-world Organizational Certificate Dataset: a Practical Outlook
Kamiński, Konrad
Mazurczyk, Wojciech
Certificates; X.509; RSA keys; PKI; vulnerabilities; RSA factorization
This research investigates the intricacies of X.509 certificates within a comprehensive corporate infrastructure. Spanning over two decades, the examined enterprise has heavily depended on its internal certificate authority and Public Key Infrastructure (PKI) to uphold its data and systems security. With the broad application of these certificates, from personal identification on smart cards to device and workstation authentication via Trusted Platform Modules (TPM), our study seeks to address a pertinent question on how prevalent are weak RSA keys within such a vast internal certificate repository. Previous research focused primarily on key sets publicly accessible from TLS and SSH servers or PGP key repositories. On the contrary, our investigation provides insights into the private domain of an enterprise, introducing new dimensions to this problem. Among our considerations are the trustworthiness of hardware and software solutions in generating keys and the consequential implications of identified vulnerabilities on organizational risk management. The obtained results can contribute to enhancing security strategies in enterprises.
Electronics and Telecommunications Committee
Orange Polska
2023-10-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.147704
International Journal of Electronics and Telecommunications; Vol 69, No 4 (2023); 803-810
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-ijet.2023.147704/1166
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.147704/4271
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.147704/4272
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.147704/4273
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-ijet.2023.147704/4274
Copyright (c) 2023 International Journal of Electronics and Telecommunications
oai:ojs.ijet.ise.pw.edu.pl:article/1151
2018-04-27T08:36:48Z
ijet:CRYPTO
Pure Infinitely Self-Modifying Code is Realizable and Turing-complete
Morse, Gregory
Theory of computation; Cryptography; Computer architecture
Although self-modifying code has been shyed away from due to its complexity and discouragement due to safety issues, it nevertheless provides for a very unique obfuscation method and a different perspective on the relationship between data and code. The generality of the von Neumann architecture is hardly realized by today's processor models. A code-only model is shown where every instruction merely modifies other instructions yet achieves the ability to compute and Turing machine operation is easily possible.
Electronics and Telecommunications Committee
2018-04-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
application/pdf
http://ijet.pl/index.php/ijet/article/view/10.24425-119359
International Journal of Electronics and Telecommunications; Vol 64, No 2 (2018); 123-129
2300-1933
eng
http://ijet.pl/index.php/ijet/article/view/10.24425-119359/447
http://ijet.pl/index.php/ijet/article/downloadSuppFile/10.24425-119359/929
Copyright (c) 2018 International Journal of Electronics and Telecommunications