Pub Date : 2022-06-29DOI: 10.1142/S0129054123500132
Giuseppe D'Alconzo
This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one.
{"title":"A note on a Code-Based Signature Scheme","authors":"Giuseppe D'Alconzo","doi":"10.1142/S0129054123500132","DOIUrl":"https://doi.org/10.1142/S0129054123500132","url":null,"abstract":"This paper analyzes two schemes from a 2019 work by Liu, Yang, Han and Wang, namely, adapting the McEliece cryptosystem to obtain a new public-key encryption scheme, and designing an efficient CFS-like digital signature. It is shown that the new encryption scheme based on McEliece, even if it has longer public keys, is not more secure than the standard one. The security gap between the original scheme and its modification is presented. Moreover, while the proposed parameters for the digital signature scheme lead to a significant performance improvement, however, they introduce a vulnerability in the protocol. A key-forgery attack using the Support Splitting Algorithm as a subroutine is described, with a study of the computational cost of retrieving the secret key from the public one.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"abs/2206.14560 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64087922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-10DOI: 10.1142/s0129054122420011
K. Raju, A. Nagarajan
Steganography is a data hiding method mainly used in the security purposes. While hiding more data in the embedding process the data may be lost and also cause some security problems. To avoid this problem a Steganography Embedding method is used. In this manuscript, Steganography Embedding method based on Cohen–Daubechies–Feauveau Discrete Wavelet Transform (CDF-DWT) technique to data hiding application using Elgamal algorithm is proposed. In this the cover image is taken for hiding the secret data. Then the cover image edges are detected and filtered with Speeded-Up Robust Features (SURF) method. Then the input secret data is encrypted with Elgamal algorithm. Then the secret data is hided under cover image for obtaining the stego image by process of Embedding using CDF DWT technique. In this data in the stego images are unreadable. To get readable secured data is extracted from the stego image and the data’s are decrypted to get secured secret data. The objective of this method is to safe guard the secret using Steganography method and to increase embedding efficiency, Embedding capacity and carrier capacity and to reduce the execution time. The MATLAB simulation results of the proposed CDF DWT technique with Elgamal algorithm portrays better outcomes such as Peak to Signal Noise Ratio (PSNR), Mean Square Error (MSE) (lower), Bit Error Rate (BER) was Lower, Execution time provides is lower, Carrier Capacity and Embedding Capacity are much higher and the values are compared with the existing method such as Elliptic Galois in cryptography and in the Steganography method with Adaptive Firefly Algorithm (EGC-AFA), Reversible Data hiding within Encrypted images Via Adaptive Embedding Strategy with block selection (RDHEI-AES), Double Linear Regression Prediction based Reversible Data Hiding in Encrypted Image (DLRP-RDHEI) respectively.
{"title":"A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm","authors":"K. Raju, A. Nagarajan","doi":"10.1142/s0129054122420011","DOIUrl":"https://doi.org/10.1142/s0129054122420011","url":null,"abstract":"Steganography is a data hiding method mainly used in the security purposes. While hiding more data in the embedding process the data may be lost and also cause some security problems. To avoid this problem a Steganography Embedding method is used. In this manuscript, Steganography Embedding method based on Cohen–Daubechies–Feauveau Discrete Wavelet Transform (CDF-DWT) technique to data hiding application using Elgamal algorithm is proposed. In this the cover image is taken for hiding the secret data. Then the cover image edges are detected and filtered with Speeded-Up Robust Features (SURF) method. Then the input secret data is encrypted with Elgamal algorithm. Then the secret data is hided under cover image for obtaining the stego image by process of Embedding using CDF DWT technique. In this data in the stego images are unreadable. To get readable secured data is extracted from the stego image and the data’s are decrypted to get secured secret data. The objective of this method is to safe guard the secret using Steganography method and to increase embedding efficiency, Embedding capacity and carrier capacity and to reduce the execution time. The MATLAB simulation results of the proposed CDF DWT technique with Elgamal algorithm portrays better outcomes such as Peak to Signal Noise Ratio (PSNR), Mean Square Error (MSE) (lower), Bit Error Rate (BER) was Lower, Execution time provides is lower, Carrier Capacity and Embedding Capacity are much higher and the values are compared with the existing method such as Elliptic Galois in cryptography and in the Steganography method with Adaptive Firefly Algorithm (EGC-AFA), Reversible Data hiding within Encrypted images Via Adaptive Embedding Strategy with block selection (RDHEI-AES), Double Linear Regression Prediction based Reversible Data Hiding in Encrypted Image (DLRP-RDHEI) respectively.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"33 1","pages":"489-512"},"PeriodicalIF":0.8,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64087654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-18DOI: 10.1142/s0129054122020014
E. Csuhaj-Varjú, P. Dömösi, György Vaszil
{"title":"Special Issue – 15th International Conference on Automata and Formal Languages: Preface","authors":"E. Csuhaj-Varjú, P. Dömösi, György Vaszil","doi":"10.1142/s0129054122020014","DOIUrl":"https://doi.org/10.1142/s0129054122020014","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64087587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-12-01DOI: 10.1142/s012905412199001x
{"title":"Author Index Volume 32 (2021)","authors":"","doi":"10.1142/s012905412199001x","DOIUrl":"https://doi.org/10.1142/s012905412199001x","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46347134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-20DOI: 10.1142/s0129054121500337
P. Renjith, N. Sadagopan
For an optimization problem known to be NP-Hard, the dichotomy study investigates the reduction instances to determine the line separating polynomial-time solvable vs NP-Hard instances (easy vs hard instances). In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete on planar bipartite graphs with maximum degree [Formula: see text]. We use this result to show that HCYCLE is NP-complete for [Formula: see text]-free split graphs. Further, we present polynomial-time algorithms for Hamiltonian cycle in [Formula: see text]-free and [Formula: see text]-free split graphs. We believe that the structural results presented in this paper can be used to show similar dichotomy result for Hamiltonian path problem and other variants of Hamiltonian cycle (path) problems.
{"title":"Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy","authors":"P. Renjith, N. Sadagopan","doi":"10.1142/s0129054121500337","DOIUrl":"https://doi.org/10.1142/s0129054121500337","url":null,"abstract":"For an optimization problem known to be NP-Hard, the dichotomy study investigates the reduction instances to determine the line separating polynomial-time solvable vs NP-Hard instances (easy vs hard instances). In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete on planar bipartite graphs with maximum degree [Formula: see text]. We use this result to show that HCYCLE is NP-complete for [Formula: see text]-free split graphs. Further, we present polynomial-time algorithms for Hamiltonian cycle in [Formula: see text]-free and [Formula: see text]-free split graphs. We believe that the structural results presented in this paper can be used to show similar dichotomy result for Hamiltonian path problem and other variants of Hamiltonian cycle (path) problems.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43431064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-01DOI: 10.1142/s0129054120990014
{"title":"Author Index Volume 31 (2020)","authors":"","doi":"10.1142/s0129054120990014","DOIUrl":"https://doi.org/10.1142/s0129054120990014","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47737001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-29DOI: 10.1142/S0129054120400018
F. Montoro, S. Gómez-Canaval, Karina Jiménez Vega, A. O. D. L. Puente
In this paper we consider a new variant of Networks of Polarized Evolutionary Processors (NPEP) named Generalized Networks of Evolutionary Polarized Processors (GNPEP) and propose them as solvers of combinatorial optimization problems. Unlike the NPEP model, GNPEP uses its numerical evaluation over the processed data from a quantitative perspective, hence this model might be more suitable to solve specific hard problems in a more efficient and economic way. In particular, we propose a GNPEP network to solve a well-known NP-hard problem, namely the [Formula: see text]-queens. We prove that this GNPEP algorithm requires a linear time in the size of a given instance. This result suggests that the GNPEP model is more suitable to address problems related to combinatorial optimization in which integer restrictions have a relevant role.
{"title":"A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors","authors":"F. Montoro, S. Gómez-Canaval, Karina Jiménez Vega, A. O. D. L. Puente","doi":"10.1142/S0129054120400018","DOIUrl":"https://doi.org/10.1142/S0129054120400018","url":null,"abstract":"In this paper we consider a new variant of Networks of Polarized Evolutionary Processors (NPEP) named Generalized Networks of Evolutionary Polarized Processors (GNPEP) and propose them as solvers of combinatorial optimization problems. Unlike the NPEP model, GNPEP uses its numerical evaluation over the processed data from a quantitative perspective, hence this model might be more suitable to solve specific hard problems in a more efficient and economic way. In particular, we propose a GNPEP network to solve a well-known NP-hard problem, namely the [Formula: see text]-queens. We prove that this GNPEP algorithm requires a linear time in the size of a given instance. This result suggests that the GNPEP model is more suitable to address problems related to combinatorial optimization in which integer restrictions have a relevant role.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"31 1","pages":"7-21"},"PeriodicalIF":0.8,"publicationDate":"2020-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S0129054120400018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48425231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-12-01DOI: 10.1142/s0129054119990016
{"title":"Author Index Volume 30 (2019)","authors":"","doi":"10.1142/s0129054119990016","DOIUrl":"https://doi.org/10.1142/s0129054119990016","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/s0129054119990016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64087544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1142/s0129054118990010
{"title":"Author Index Volume 29 (2018)","authors":"","doi":"10.1142/s0129054118990010","DOIUrl":"https://doi.org/10.1142/s0129054118990010","url":null,"abstract":"","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/s0129054118990010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42117753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.1142/s0129054118500314
Mostafa Nouri-Baygi
In the past decades, there has been a burst of activity to simplify implementation of complex software systems. The solution framework in software engineering community for this problem is called component-based software design (CBSD), whereas in the modeling and simulation community it is called composability. Composability is a complex feature due to the challenges of creating components, selecting combinations of components, and integrating the selected components. In this paper, we address the challenge through the analysis of Component Selection (CS), the NP-complete process of selecting a minimal set of components to satisfy a set of objectives. Due to the computational complexity of CS, we consider approximation algorithms that make the component selection process practical. We define three variations of CS and present good approximation algorithms to find near optimal solutions. In spite of our creation of approximable variants of Component Selection, we prove that the general Component Selection problem is inapproximable.
{"title":"The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem","authors":"Mostafa Nouri-Baygi","doi":"10.1142/s0129054118500314","DOIUrl":"https://doi.org/10.1142/s0129054118500314","url":null,"abstract":"In the past decades, there has been a burst of activity to simplify implementation of complex software systems. The solution framework in software engineering community for this problem is called component-based software design (CBSD), whereas in the modeling and simulation community it is called composability. Composability is a complex feature due to the challenges of creating components, selecting combinations of components, and integrating the selected components. In this paper, we address the challenge through the analysis of Component Selection (CS), the NP-complete process of selecting a minimal set of components to satisfy a set of objectives. Due to the computational complexity of CS, we consider approximation algorithms that make the component selection process practical. We define three variations of CS and present good approximation algorithms to find near optimal solutions. In spite of our creation of approximable variants of Component Selection, we prove that the general Component Selection problem is inapproximable.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86975087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：