scholarly journals A Pseudorandom-Function Mode Based on Lesamnta-LW and the MDP Domain Extension and Its Applications

2018 ◽  
Vol E101.A (1) ◽  
pp. 110-118 ◽  
Author(s):  
Shoichi HIROSE ◽  
Hidenori KUWAKADO ◽  
Hirotaka YOSHIDA
Keyword(s):  
Domain Extension ◽  
Pseudorandom Function

Full Aperture Imagining Algorithm of TOPSAR Based on Frequency Domain Extension and SPECAN

2013 ◽  
Vol 34 (10) ◽  
pp. 2445-2450 ◽  
Author(s):  
Qi Chen ◽  
Hai-feng Huang ◽  
Feng He ◽  
Dian-nong Liang ◽  
Zhen Dong
Keyword(s):  
Frequency Domain ◽  
Domain Extension

scholarly journals Fuzzy Lattice Reasoning for Pattern Classification Using a New Positive Valuation Function

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Yazdan Jamshidi Khezeli ◽  
Hossein Nezamabadi-pour
Keyword(s):  
Pattern Classification ◽  
Fuzzy Artmap ◽  
Lattice Data ◽  
Valuation Function ◽  
Measure Function ◽  
Inclusion Measure ◽  
Domain Extension ◽  
Fuzzy Lattice ◽  
Neural Classifier ◽  
Modified Algorithm

This paper describes an enhancement of fuzzy lattice reasoning (FLR) classifier for pattern classification based on a positive valuation function. Fuzzy lattice reasoning (FLR) was described lately as a lattice data domain extension of fuzzy ARTMAP neural classifier based on a lattice inclusion measure function. In this work, we improve the performance of FLR classifier by defining a new nonlinear positive valuation function. As a consequence, the modified algorithm achieves better classification results. The effectiveness of the modified FLR is demonstrated by examples on several well-known pattern recognition benchmarks.

scholarly journals On Length Independent Security Bounds for the PMAC Family

2021 ◽  
pp. 423-445
Author(s):  
Bishwajit Chakraborty ◽  
Soumya Chattopadhyay ◽  
Ashwin Jha ◽  
Mridul Nandi
Keyword(s):  
Block Cipher ◽  
Block Size ◽  
Gray Code ◽  
Tight Bound ◽  
Simple Modification ◽  
Security Proof ◽  
Tight Security ◽  
Pseudorandom Function ◽  
Exact Security ◽  
Query Length

At FSE 2017, Gaži et al. demonstrated a pseudorandom function (PRF) distinguisher (Gaži et al., ToSC 2016(2)) on PMAC with Ω(lq2/2n) advantage, where q, l, and n, denote the number of queries, maximum permissible query length (in terms of n-bit blocks), and block size of the underlying block cipher. This, in combination with the upper bounds of Ο(lq2/2n) (Minematsu and Matsushima, FSE 2007) and Ο(qσ/2n) (Nandi and Mandal, J. Mathematical Cryptology 2008(2)), resolved the long-standing problem of exact security of PMAC. Gaži et al. also showed that the dependency on l can be dropped (i.e. O(q2/2n) bound up to l ≤ 2n/2) for a simplified version of PMAC, called sPMAC, by replacing the Gray code-based masking in PMAC with any 4-wise independent universal hash-based masking. Recently, Naito proposed another variant of PMAC with two powering-up maskings (Naito, ToSC 2019(2)) that achieves l-free bound of O(q2/2n), provided l ≤ 2n/2. In this work, we first identify a flaw in the analysis of Naito’s PMAC variant that invalidates the security proof. Apparently, the flaw is not easy to fix under the existing proof setup. We then formulate an equivalent problem which must be solved in order to achieve l-free security bounds for this variant. Second, we show that sPMAC achieves O(q2/2n) bound for a weaker notion of universality as compared to the earlier condition of 4-wise independence. Third, we analyze the security of PMAC1 (a popular variant of PMAC) with a simple modification in the linear combination of block cipher outputs. We show that this simple modification of PMAC1 has tight security O(q2/2n) provided l ≤ 2n/4. Even if l < 2n/4, we still achieve same tight bound as long as total number of blocks in all queries is less than 22n/3.

scholarly journals Orthros: A Low-Latency PRF

2021 ◽  
pp. 37-77
Author(s):  
Subhadeep Banik ◽  
Takanori Isobe ◽  
Fukang Liu ◽  
Kazuhiko Minematsu ◽  
Kosei Sakamoto
Keyword(s):  
Hardware Implementation ◽  
Block Cipher ◽  
State Of The Art ◽  
Security Analysis ◽  
Parallel Structure ◽  
Low Latency ◽  
Round Function ◽  
Minimum Latency ◽  
Primary Focus ◽  
Pseudorandom Function

We present Orthros, a 128-bit block pseudorandom function. It is designed with primary focus on latency of fully unrolled circuits. For this purpose, we adopt a parallel structure comprising two keyed permutations. The round function of each permutation is similar to Midori, a low-energy block cipher, however we thoroughly revise it to reduce latency, and introduce different rounds to significantly improve cryptographic strength in a small number of rounds. We provide a comprehensive, dedicated security analysis. For hardware implementation, Orthros achieves the lowest latency among the state-of-the-art low-latency primitives. For example, using the STM 90nm library, Orthros achieves a minimum latency of around 2.4 ns, while other constructions like PRINCE, Midori-128 and QARMA9-128- σ0 achieve 2.56 ns, 4.10 ns, 4.38 ns respectively.

An Energy-Related CityGML ADE and Its Application for Heating Demand Calculation

2019 ◽  
pp. 1306-1323
Author(s):  
Marcel Bruse ◽  
Romain Nouvel ◽  
Parag Wate ◽  
Volker Kraut ◽  
Volker Coors
Keyword(s):  
Energy Demand ◽  
Building Energy ◽  
Energy Simulation ◽  
Data Sets ◽  
Application Domain ◽  
Data Formats ◽  
Building Energy Systems ◽  
Domain Extension ◽  
Energy Simulations ◽  
Heating Energy Demand

Different associated properties of city models like building geometries, building energy systems, building end uses, and building occupant behavior are usually saved in different data formats and are obtained from different data sources. Experience has shown that the integration of these data sets for the purpose of energy simulation on city scale is often cumbersome and error prone. A new application domain extension for CityGML has been developed in order to integrate energy-related figures of buildings, thermal volumes, and facades with their geometric descriptions. These energy-related figures can be parameters or results of energy simulations. The applicability of the new application domain extension has been demonstrated for heating energy demand calculation.

Sign in / Sign up

Export Citation Format

Share Document