Results 261 to 270 of about 1,407,158 (281)
Some of the next articles are maybe not open access.
Differential implementations of threshold logic gates
SCS 2003. International Symposium on Signals, Circuits and Systems. Proceedings (Cat. No.03EX720), 2004This paper reviews differential implementations of threshold logic gates, detailing two classes of solutions: capacitive (switched capacitor and floating gate), and conductance/current.
V. Beiu +3 more
openaire +1 more source
Optical Implementations Of Lumped Threshold Logic
SPIE Proceedings, 1986Optically implemented threshold logic systems that are characterized by thresholding operations concentrated at one functional location are considered. The objective is to identify architectures and associated integrated optical and holographic techniques that might be used to design superior register-level computation modules.
S. C. Gustafson +4 more
openaire +1 more source
Uniform First-Order Threshold Implementations
2017Most masking schemes used as a countermeasure against side-channel analysis attacks require an extensive amount of fresh random bits on the fly. This is burdensome especially for lightweight cryptosystems. Threshold implementations (TIs) that are secure against first-order attacks have the advantage that fresh randomness is not required if the sharing ...
Tim Beyne, Begül Bilgin
openaire +1 more source
About complexity of implementing threshold functions
Russian Mathematics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Dividing the threshold: Multi-probe localized EM analysis on threshold implementations
2018 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), 2018Cryptographic implementations typically need to be secured to retain their secrets in the presence of attacks. As a countermeasure to prevent side-channel attacks, threshold implementations are a commonly encountered concept. They resemble a multi-party computation, where the value is split in independent shares and processed separately.
Robert Specht +4 more
openaire +1 more source
On Non-Completeness in Threshold Implementations
Proceedings of ACM Workshop on Theory of Implementation Security Workshop, 2019In this note we study non-completeness, the key property of Threshold Implementations (TIs). TIs have proved to be a popular method for mitigating side-channel leakage of sensitive information in hardware implementations of cryptographic algorithms. In particular, we provide a reformulation of non-completeness in terms of set coverings with constraints,
openaire +1 more source
Threshold logic implementations: the early days
2003 46th Midwest Symposium on Circuits and Systems, 2006This paper gives a brief account of the results on hardware implementations of threshold logic obtained starting from the forties. The solutions are sorted chronologically, by order of their publication date, although the order would be somehow different by submission date.
openaire +1 more source
CMOS Implementation of Generalized Threshold Functions
2003Threshold Logic (TL) gates can evaluate any linearly separable function via the computation of a weighted sum over the input variables. In this paper we generalize this mechanism and introduce the novel concept of k-order Generalized Threshold Logic (GTL) gates.
Marius Padure +2 more
openaire +1 more source
On minimum error thresholding and its implementations
Pattern Recognition Letters, 1988Abstract In this paper we discuss the thresholding methods [1] due to Kittler and Illingworth. Two methods are suggested in [1], namely, 1) minimizing a criterion function aand 2) iterative search of the minimum error threshold. We have tested the two methods.
Qin-Zhong Ye, Per-Erik Danielsson
openaire +1 more source
Discussions on Implementing Iterative Hard Thresholding Algorithm
2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2014Compressive sensing is a potential technology for lossy image compression. With a given quality, we may represent an image with a few significant coefficients in the transform domain. When the number of the significant coefficients is much less than the number of the pixels, the assumption of sparse representation is satisfied.
Feng Cheng Chang, Hsiang Cheh Huang
openaire +1 more source