Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00040
Sandro Preto, F. Manyà, M. Finger
We define a new reduction from the Boolean Maximum Satisfiability problem (MaxSAT) to the Satisfiability problem (SAT) of Łukasiewicz logic. This reduction is particularly interesting from a problem solving perspective because it shows how to encode cardinality constraints using Łukasiewicz logic. Moreover, we describe how to implement a MaxSAT solver using the proposed reduction.
{"title":"Linking Łukasiewicz Logic and Boolean Maximum Satisfiability","authors":"Sandro Preto, F. Manyà, M. Finger","doi":"10.1109/ISMVL57333.2023.00040","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00040","url":null,"abstract":"We define a new reduction from the Boolean Maximum Satisfiability problem (MaxSAT) to the Satisfiability problem (SAT) of Łukasiewicz logic. This reduction is particularly interesting from a problem solving perspective because it shows how to encode cardinality constraints using Łukasiewicz logic. Moreover, we describe how to implement a MaxSAT solver using the proposed reduction.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115451148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00043
D. MacFarlane, H. Shahoei, Ifeanyi G. Achu, Evan J Stewart, Wiliam V. Oxford, Mitchell A. Thornton
Physically Unclonable Function (PUF) optical circuits are described and implemented within a Photonic Integrated Circuit (PIC) to enhance certain security properties such as device authentication, anti-tamper properties, or for use as a root-of-trust value. Optical processing is advantageous for security applications such as these since they are less susceptible to eavesdropping and side channel monitoring via the difficulty of observing electromagnetic radiation emissions during PIC operation. We employ the use of State of Output Polarization (SOP) variability arising from inherent stresses, strains and manufacturing tolerances present within a fabricated PIC. A customized optical signal processing element is used in our PUF circuit that contains a very narrow "trench" structure with tiny structural variations induced during fabrication that enhances SOP variability. The tiny structural changes in fabricated PICs are fixed resulting in repeatable SOP variation of the optical signals. To avoid a need for PUF calibration, to increase robustness with respect to input power level variation, measurement device resolution and sensitivity; we show that PUF functionality can be conveniently modeled as a discrete MultipleValued Logic (MVL) function. The proposed MVL PUF formulation avoids the need to characterize and measure exact polarization states as well as enabling the use of PUF output measurement devices that have a wide range of resolution and sensitivity specifications. Several different PUF circuits are implemented within a single fabricated PIC and are experimentally evaluated to demonstrate its efficacy.
{"title":"Multiple-Valued Logic Physically Unclonable Function in Photonic Integrated Circuits","authors":"D. MacFarlane, H. Shahoei, Ifeanyi G. Achu, Evan J Stewart, Wiliam V. Oxford, Mitchell A. Thornton","doi":"10.1109/ISMVL57333.2023.00043","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00043","url":null,"abstract":"Physically Unclonable Function (PUF) optical circuits are described and implemented within a Photonic Integrated Circuit (PIC) to enhance certain security properties such as device authentication, anti-tamper properties, or for use as a root-of-trust value. Optical processing is advantageous for security applications such as these since they are less susceptible to eavesdropping and side channel monitoring via the difficulty of observing electromagnetic radiation emissions during PIC operation. We employ the use of State of Output Polarization (SOP) variability arising from inherent stresses, strains and manufacturing tolerances present within a fabricated PIC. A customized optical signal processing element is used in our PUF circuit that contains a very narrow \"trench\" structure with tiny structural variations induced during fabrication that enhances SOP variability. The tiny structural changes in fabricated PICs are fixed resulting in repeatable SOP variation of the optical signals. To avoid a need for PUF calibration, to increase robustness with respect to input power level variation, measurement device resolution and sensitivity; we show that PUF functionality can be conveniently modeled as a discrete MultipleValued Logic (MVL) function. The proposed MVL PUF formulation avoids the need to characterize and measure exact polarization states as well as enabling the use of PUF output measurement devices that have a wide range of resolution and sensitivity specifications. Several different PUF circuits are implemented within a single fabricated PIC and are experimentally evaluated to demonstrate its efficacy.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125150964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00023
C. Moraga, R. Stankovic, M. Stankovic
The Reed-Muller-Fourier spectrum of p-valued (p prime, p > 2) Maiorana-McFarland bent functions is studied. It is shown that this spectrum exhibits a unique structure, which allows characterizing these functions and to distinguish them from other p-valued bent functions.
研究了p值(p '， p > 2) Maiorana-McFarland弯曲函数的Reed-Muller-Fourier谱。结果表明，该谱具有独特的结构，可以表征这些函数，并将它们与其他p值弯曲函数区分开来。
{"title":"Properties of the Reed-Muller-Fourier Spectra of Maiorana-McFarland Bent Functions","authors":"C. Moraga, R. Stankovic, M. Stankovic","doi":"10.1109/ISMVL57333.2023.00023","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00023","url":null,"abstract":"The Reed-Muller-Fourier spectrum of p-valued (p prime, p > 2) Maiorana-McFarland bent functions is studied. It is shown that this spectrum exhibits a unique structure, which allows characterizing these functions and to distinguish them from other p-valued bent functions.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123748161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00029
Yosuke Iijima, Kazuharu Nakajima, Y. Yuminaka
This study presents an evaluation methodology using a linear mixture model (LMM) with 2-dimensional (2D) symbol mapping for multi-valued data transmission. A 2D map of the transmitted signal can be visualized on a 2D plane. The LMM enables numerical modeling of symbol distribution characteristics. Simulation results showed that the characteristics of the received end-symbol distribution can be quantified by adjusting and determining the LMM parameters from the measured symbols using a genetic algorithm, even in the absence of an eye aperture in the eye diagram evaluation. Additionally, by extracting features of the distribution of multilevel received symbols with the LMM, as in unsupervised learning, unknown received symbols can be clustered with the LMM. Therefore, symbol determination is possible even when the eye is completely closed owing to severe intersymbol interference (ISI). The results of the 4-level pulse amplitude modulation transmission simulation show that it is possible to completely cluster and determine the received symbols, even when the eye is completely closed.
{"title":"Evaluation and Symbol Classification of Multi-Valued Signaling Using Two-Dimensional Symbol Mapping with Linear Mixture Model","authors":"Yosuke Iijima, Kazuharu Nakajima, Y. Yuminaka","doi":"10.1109/ISMVL57333.2023.00029","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00029","url":null,"abstract":"This study presents an evaluation methodology using a linear mixture model (LMM) with 2-dimensional (2D) symbol mapping for multi-valued data transmission. A 2D map of the transmitted signal can be visualized on a 2D plane. The LMM enables numerical modeling of symbol distribution characteristics. Simulation results showed that the characteristics of the received end-symbol distribution can be quantified by adjusting and determining the LMM parameters from the measured symbols using a genetic algorithm, even in the absence of an eye aperture in the eye diagram evaluation. Additionally, by extracting features of the distribution of multilevel received symbols with the LMM, as in unsupervised learning, unknown received symbols can be clustered with the LMM. Therefore, symbol determination is possible even when the eye is completely closed owing to severe intersymbol interference (ISI). The results of the 4-level pulse amplitude modulation transmission simulation show that it is possible to completely cluster and determine the received symbols, even when the eye is completely closed.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125741183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00039
Sandro Preto, F. Manyà, M. Finger
We propose new benchmarks for problems related to Łukasiewicz Infinitely-valued Logic and discuss methods for generating them. Such benchmarks comprehend instances that state properties about neural networks. In particular, reachability properties yield satisfiability instances and robustness properties yield logical consequence instances. We also present the results of empirical experiments where the proposed benchmarks were run in solvers based on SMT and MILP technologies. In this way, we are able, on the one hand, to compare the performance of different solvers and, on the other hand, to delve deeper into the investigation of neural network formal verification.
{"title":"Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks","authors":"Sandro Preto, F. Manyà, M. Finger","doi":"10.1109/ISMVL57333.2023.00039","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00039","url":null,"abstract":"We propose new benchmarks for problems related to Łukasiewicz Infinitely-valued Logic and discuss methods for generating them. Such benchmarks comprehend instances that state properties about neural networks. In particular, reachability properties yield satisfiability instances and robustness properties yield logical consequence instances. We also present the results of empirical experiments where the proposed benchmarks were run in solvers based on SMT and MILP technologies. In this way, we are able, on the one hand, to compare the performance of different solvers and, on the other hand, to delve deeper into the investigation of neural network formal verification.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133766231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00044
Kalle Ngo, Ruize Wang, E. Dubrova, Nils Paulsrud
Public-key cryptographic schemes currently in use depend on the intractability of certain mathematical problems such as integer factorization or the discrete logarithm. However, Shor’s algorithm can solve these problems in polynomial time if large-scale quantum computers become available. This will compromise the security of today’s public-key cryptosystems. To address this issue, new public-key cryptographic primitives are being developed. One of them is Saber whose security relies on the Learning With Rounding (LWR) problem that is believed to be hard for quantum computers. The resistance of unprotected and first-order masked implementations of Saber to side-channel attacks has been already investigated. In this paper, we demonstrate the first successful message and secret key recovery attacks on the second- and third-order masked implementations of Saber in ARM Cortex-M4 CPU by deep learning-based power analysis. Our experimental results show that currently available software implementations of Saber need better protection.
{"title":"Higher-Order Boolean Masking Does Not Prevent Side-Channel Attacks on LWE/LWR-based PKE/KEMs","authors":"Kalle Ngo, Ruize Wang, E. Dubrova, Nils Paulsrud","doi":"10.1109/ISMVL57333.2023.00044","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00044","url":null,"abstract":"Public-key cryptographic schemes currently in use depend on the intractability of certain mathematical problems such as integer factorization or the discrete logarithm. However, Shor’s algorithm can solve these problems in polynomial time if large-scale quantum computers become available. This will compromise the security of today’s public-key cryptosystems. To address this issue, new public-key cryptographic primitives are being developed. One of them is Saber whose security relies on the Learning With Rounding (LWR) problem that is believed to be hard for quantum computers. The resistance of unprotected and first-order masked implementations of Saber to side-channel attacks has been already investigated. In this paper, we demonstrate the first successful message and secret key recovery attacks on the second- and third-order masked implementations of Saber in ARM Cortex-M4 CPU by deep learning-based power analysis. Our experimental results show that currently available software implementations of Saber need better protection.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115806996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ismvl57333.2023.00011
{"title":"Keynote III: Card-based Cryptography: How to Securely Compute Multiple-valued Functions Using a Deck of Cards","authors":"","doi":"10.1109/ismvl57333.2023.00011","DOIUrl":"https://doi.org/10.1109/ismvl57333.2023.00011","url":null,"abstract":"","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122020316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00025
Shinobu Nagayama, Tsutomu Sasao, J. T. Butler
Symmetric multiple-valued functions are a basic class of multiple-valued functions such that function values are unchanged by any permutation of input variable labels. They appear in various situations such as arithmetic operations. A compact representation of symmetric multiple-valued functions benefits many applications. To represent symmetric multiple-valued functions compactly, this paper focuses on functional decomposition and decision diagrams. We propose a method that decomposes a symmetric multiple-valued function into three parts, and represents the three parts using suitable decision diagrams. This paper also derives theorems on sizes of the decision diagrams. Experimental results using randomly generated symmetric multiple-valued functions show the effectiveness of the proposed method.
{"title":"Decomposition-Based Representation of Symmetric Multiple-Valued Functions","authors":"Shinobu Nagayama, Tsutomu Sasao, J. T. Butler","doi":"10.1109/ISMVL57333.2023.00025","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00025","url":null,"abstract":"Symmetric multiple-valued functions are a basic class of multiple-valued functions such that function values are unchanged by any permutation of input variable labels. They appear in various situations such as arithmetic operations. A compact representation of symmetric multiple-valued functions benefits many applications. To represent symmetric multiple-valued functions compactly, this paper focuses on functional decomposition and decision diagrams. We propose a method that decomposes a symmetric multiple-valued function into three parts, and represents the three parts using suitable decision diagrams. This paper also derives theorems on sizes of the decision diagrams. Experimental results using randomly generated symmetric multiple-valued functions show the effectiveness of the proposed method.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00028
Y. Yuminaka, Kazuharu Nakajima, Yosuke Iijima
Based on four-level pulse-amplitude modulation (PAM-4) symbol transition, this study investigated a two-dimensional (2D) symbol mapping technique that evaluates the quality of transmission data to set equalizer parameters adaptively. The 2D symbol transition mapping enables visualization of the degree of intersymbol interference (ISI). The simulation results demonstrate that the 2D symbol mapping can evaluate the PAM-4 data transmission quality degraded by ISI and can visualize the effect of equalization. The applications of 2D mapping and the extension of 2D mapping to 3D mapping are also discussed.
{"title":"PAM-4 Data Transmission Quality Evaluation Using Two- and Three-Dimensional Mapping of Received Symbols","authors":"Y. Yuminaka, Kazuharu Nakajima, Yosuke Iijima","doi":"10.1109/ISMVL57333.2023.00028","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00028","url":null,"abstract":"Based on four-level pulse-amplitude modulation (PAM-4) symbol transition, this study investigated a two-dimensional (2D) symbol mapping technique that evaluates the quality of transmission data to set equalizer parameters adaptively. The 2D symbol transition mapping enables visualization of the degree of intersymbol interference (ISI). The simulation results demonstrate that the 2D symbol mapping can evaluate the PAM-4 data transmission quality degraded by ISI and can visualize the effect of equalization. The applications of 2D mapping and the extension of 2D mapping to 3D mapping are also discussed.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130877339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-05-01DOI: 10.1109/ISMVL57333.2023.00014
Tsutomu Sasao
This paper shows that sum-of-product expression (SOP) minimization produces the generalization ability. We show this in three steps. First, various classes SOPs are generated. Second, minterms of SOP are randomly selected to generate partially defined functions. And, third, from the partially defined functions, original functions are reconstructed by SOP minimization. We consider Achilles heel functions, majority functions, monotone increasing cascade functions, functions generated from random SOPs, and monotone increasing random SOPs. As for generalization ability, the presented method is compared with Naive Bayes, multi-level perceptron, support vector machine, JRIP, J48, and random forest.
{"title":"Easily Reconstructable Logic Functions","authors":"Tsutomu Sasao","doi":"10.1109/ISMVL57333.2023.00014","DOIUrl":"https://doi.org/10.1109/ISMVL57333.2023.00014","url":null,"abstract":"This paper shows that sum-of-product expression (SOP) minimization produces the generalization ability. We show this in three steps. First, various classes SOPs are generated. Second, minterms of SOP are randomly selected to generate partially defined functions. And, third, from the partially defined functions, original functions are reconstructed by SOP minimization. We consider Achilles heel functions, majority functions, monotone increasing cascade functions, functions generated from random SOPs, and monotone increasing random SOPs. As for generalization ability, the presented method is compared with Naive Bayes, multi-level perceptron, support vector machine, JRIP, J48, and random forest.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130215356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：