Special issue on logics and artificial intelligence

There is a significant range of ongoing challenges in artificial intelligence (AI) dealing with reasoning, planning, learning, perception and cognition, among others. In this scenario, many-valued logics emerge as one of the topics in many of the solutions to some of those AI problems. This special issue presents a brief introduction to the relation between logics and AI and collects recent research works on logic-based approaches in AI

Klonovi nedeterminističkih operacija

This thesis is a survey of some well-known and several new results concerning lattices of total, partial, incompletely specified clones and hyper-clones. We assign to every partial, incompletely specified and hyperoperation a suitable total operation and investigate thereby induced embeddings of the three lattices into corresponding lattices of total clones. Next we modify the famous Galois connection (Pol,Inv) between relations and operations for partial operations, IS operations and hyperoperations and describe classes of clones of IS operations and hyperoperations which strongly and weakly preserve given relations. We also state some known results concerning the four lattices on a two-element set. Finally, we present completeness criteria for the lattices of total and partial clones, and in the case of hyperclones and IS clones we describe four classes of coatoms, determined by four classes of Rosenberg’s relations.Ова теза представља преглед неких познатих и неколико нових резултата везаних за мреже тоталних, парцијалних, непотпуно специфицираних клонова и хиперклонова. Свакој парцијалној, непотпуно специфицираној и хипероперацији придружијемо одговарајућу тоталну операцију, и испитујемо тиме индукована потапања три мреже у одговарајуће мреже тоталних клонова. Потом познату Галоаову везу (Pol,Inv) између релација и операција модификујемо за парцијалне операције, НС опера-ције и хипероперације и описујемо класе клонова непотпуно специфици-раних и хипероперација које јако и слабо чувају дате релације. Такође наводимо неке познате резултате о мрежама на двоелементном скупу. Коначно, наводимо критеријуме комплетности за мреже тоталних и парцијалних клонова, а у случају хиперклонова и НС клонова описујемо четири класе коатома, одређених са четири класе Розенбергових релација.Ova teza predstavlja pregled nekih poznatih i nekoliko novih rezultata vezanih za mreže totalnih, parcijalnih, nepotpuno specificiranih klonova i hiperklonova. Svakoj parcijalnoj, nepotpuno specificiranoj i hiperoperaciji pridružijemo odgovarajuću totalnu operaciju, i ispitujemo time indukovana potapanja tri mreže u odgovarajuće mreže totalnih klonova. Potom poznatu Galoaovu vezu (Pol,Inv) između relacija i operacija modifikujemo za parcijalne operacije, NS opera-cije i hiperoperacije i opisujemo klase klonova nepotpuno specifici-ranih i hiperoperacija koje jako i slabo čuvaju date relacije. Takođe navodimo neke poznate rezultate o mrežama na dvoelementnom skupu. Konačno, navodimo kriterijume kompletnosti za mreže totalnih i parcijalnih klonova, a u slučaju hiperklonova i NS klonova opisujemo četiri klase koatoma, određenih sa četiri klase Rozenbergovih relacija

A First-Order SCA Resistant AES without Fresh Randomness

Since the advent of Differential Power Analysis (DPA) in the late 1990s protecting embedded devices against Side-Channel Analysis (SCA) attacks has been a major research effort. Even though many different first-order secure masking schemes are available today, when applied to the AES S-box they all require fresh random bits in every evaluation. As the quality criteria for generating random numbers on an embedded device are not well understood, an integrated Random Number Generator (RNG) can be the weak spot of any protected implementation and may invalidate an otherwise secure implementation. We present a new construction based on Threshold Implementations and Changing of the Guards to realize a first-order secure AES with zero per-round randomness. Hence, our design does not need a built-in RNG, thereby enhancing security and reducing the overhead

A Note on Masking Generic Boolean Functions

Masking is a popular countermeasure to protect cryptographic implementations against side-channel attacks (SCA). In the literature, a myriad of proposals of masking schemes can be found. They are typically defined by a masked multiplication, since this can serve as a basic building block for any nonlinear algorithm. However, when masking generic Boolean functions of algebraic degree t, it is very inefficient to construct the implementation from masked multiplications only. Further, it is not immediately clear from the description of a masked multiplication, how to efficiently implement a masked Boolean function. In this work, we fill this gap in the literature with a detailed description and investigation of a generic masking methodology for Boolean functions of any degree t at any security order d

On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials

International audienceIn this document, we consider a median-based calculus to represent monotone Boolean functions efficiently. We study an equa-tional specification of median forms and extend it from the domain of monotone Boolean functions to the domain of polynomial functions over distributive lattices. This specification is sound and complete. We illustrate its usefulness when simplifying median formulas algebraically. Furthermore, we propose a definition of median normal forms (MNF), that are thought of as minimal median formulas with respect to a structural ordering of expressions. We investigate related complexity issues and show that the problem of deciding whether a formula is in MNF, that is the problem of minimizing the median form of a monotone Boolean function, is in Σ P 2. Moreover, we show that it still holds for arbitrary Boolean functions, not necessarily monotone

暗号ハードウェアの形式的設計に関する研究

Tohoku University青木孝文課

Razvoj i analiza formalnih modela za korišćenje i deljenje resursa u distribuiranim softverskim sistemima

This thesis investigates problems of formal, mathematically based, representation and analysis of controlled usage and sharing of resources in distributed software systems. We present a model for confidential name passing, and a model for controlled resource usage. For the second model we also introduce a type system for performing a static verification that can ensure absence of unauthorized usages of resources in the system.У тези су разматрани проблеми формалног описа и анализе дељења и коришћења ресурса у дистрибуираним софтверским системима. Уведен је један рачун који моделира поверљиво дељење имена и један који моделира контролисано коришћење ресурса. За други модел предложен је и типски систем за статичку проверу који осигурава одсуство неауторизованог коришћења ресурса у систему.U tezi su razmatrani problemi formalnog opisa i analize deljenja i korišćenja resursa u distribuiranim softverskim sistemima. Uveden je jedan račun koji modelira poverljivo deljenje imena i jedan koji modelira kontrolisano korišćenje resursa. Za drugi model predložen je i tipski sistem za statičku proveru koji osigurava odsustvo neautorizovanog korišćenja resursa u sistemu

Optimised soft-core processor architecture for noise jamming

M.Ing. (Electrical & Electronic Engineering)Abstract: Noise jamming is a traditional electronic counter measure (ECM) that existed since the establishment of electronic warfare (EW). Traditional noise jamming techniques have been shown to be failing when interacting with intelligent Radar systems such as pulse Doppler radar. Hence there is a need to introduce new noise jamming techniques with digital architecture that will provide improved performance against smart pulse Doppler radar. The work is undertaken to investigate the feasibility of digitizing noise jamming. It focuses on analog-to-digital conversion optimization towards noise jamming architecture, as a result digitization will allow for an opportunity for adaptation of intelligent processing that previously didn’t exist. In this dissertation, certain contributions to the field of noise jamming were made by introducing state of the art odd/even order sampling architecture by proving four case studies. Case study 1 experimentally investigates sample frequency behaviour. Case study 2 uses simulation to investigate step-size and dynamic range behaviour. Case study 3 uses FPGA implementation and SNR to investigate quantization error behaviour. Case study 3 also uses SNR to investigate superiority of proposed odd/even order sampling. Lastly case study 4 uses field measurements, FPGA implementation and SNR to investigate practical implementation of digitized noise jamming. The main contribution is concerned with an architecture that digitizes, reduces sample frequency, optimizes digital resource utilization while reducing noise jamming signal-to-noise ratio. The approach evaluates and empirically compares three sampling techniques from lecture Mod-Δ, Mod-Δ (Gaussian) and Mod-Δ (Sinusoidal) with proposed novel odd/even order sampling. Sampling techniques are evaluated in terms of quantization error, mean square error and signal-to-noise ratio. It was found that the proposed novel odd/even order sampling achieved most case SNR performance of 6 dB in comparison to 18 dB for Mod-Δ. Sampling frequency findings indicated that the proposed novel odd/even order sampling had achieved sampling frequency of 2 kHz in comparison to 8 kHz from traditional 1st order sigma-delta. Dynamic range findings indicated that the proposed odd/even order sampling achieved a dynamic range of 1.088 volts/ms in comparison to 1.185 volts/ms from traditional 1st order sigma-delta. Findings have indicated that the proposed odd/even order sampling has superior SNR and sampling frequency..