Results 221 to 230 of about 33,516 (251)
Some of the next articles are maybe not open access.
A High-Speed Constant-Time Hardware Implementation of NTRUEncrypt SVES
2018 International Conference on Field-Programmable Technology (FPT), 2018In this paper, we present a high-speed constant-time hardware implementation of NTRUEncrypt Short Vector Encryption Scheme (SVES), fully compliant with the IEEE 1363.1 Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices.
Farnoud Farahmand +3 more
openaire +2 more sources
On Lions and Elligators: An Efficient Constant-Time Implementation of CSIDH
2019The recently proposed CSIDH primitive is a promising candidate for post quantum static-static key exchanges with very small keys. However, until now there is only a variable-time proof-of-concept implementation by Castryck, Lange, Martindale, Panny, and Renes, recently optimized by Meyer and Reith, which can leak various information about the private ...
Michael Meyer 0001 +2 more
openaire +2 more sources
A constant-time parallel sorting algorithm and its optical implementation
IEEE Micro, 1995High-speed electronic sorting networks are difficult to implement with VLSI technology because of the dense and global connectivity required. Optics eliminates this bottleneck by offering global interconnections, massive parallelism, and noninterfering communications.
Ahmed Louri +2 more
openaire +1 more source
A Constant Time Full Hardware Implementation of Streamlined NTRU Prime
2021This paper presents a constant time hardware implementation of the NIST round 2 post-quantum cryptographic algorithm Streamlined NTRU Prime. We implement the entire KEM algorithm, including all steps for key generation, encapsulation and decapsulation, and all en- and decoding. We focus on optimizing the resources used, as well as applying optimization
openaire +2 more sources
Constant-time parallel sorting algorithm and its optical implementation using smart pixels
Applied Optics, 1995Sorting is a basic, fundamental operation used for many symbolic, numeric, and artificial intelligence (AI) tasks [1]. Because of its importance, there has been a great deal of work on developing and analyzing sorting algorithms and architectures [2].
A, Louri, J A, Hatch, J, Na
openaire +2 more sources
Learning to Effectively Implement Constant Time Delay Procedures to Teach Spelling
Learning Disability Quarterly, 2002This study examined the effectiveness of a training procedure designed to teach a special education resource teacher the constant time delay procedures. In addition, the study examined the effectiveness of constant time delay procedures in teaching written spelling words to one 12-year-old male student with a learning disability.
Trudie A. Hughes +2 more
openaire +1 more source
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019
In this paper, we propose a constant-time implementation of the BLISS lattice-based signature scheme. BLISS is possibly the most efficient lattice-based signature scheme proposed so far, with a level of performance on par with widely used pre-quantum primitives like ECDSA.
Gilles Barthe +5 more
openaire +2 more sources
In this paper, we propose a constant-time implementation of the BLISS lattice-based signature scheme. BLISS is possibly the most efficient lattice-based signature scheme proposed so far, with a level of performance on par with widely used pre-quantum primitives like ECDSA.
Gilles Barthe +5 more
openaire +2 more sources
SPIE Proceedings, 2016
Spatial Averaging Filters (SAF) are extensively used in image processing for image smoothing and denoising. Their latest implementations have already achieved constant time computational complexity regardless of kernel size. However, all the existing O(1) algorithms require additional memory for temporary data storage. In order to minimize memory usage
Gan, Qifeng +3 more
openaire +1 more source
Spatial Averaging Filters (SAF) are extensively used in image processing for image smoothing and denoising. Their latest implementations have already achieved constant time computational complexity regardless of kernel size. However, all the existing O(1) algorithms require additional memory for temporary data storage. In order to minimize memory usage
Gan, Qifeng +3 more
openaire +1 more source
Efficacy of constant time delay implemented by peer tutors in general education classrooms
Journal of Behavioral Education, 1994We evaluated the effects of teaching 13 typically developing children to use constant time delay when tutoring three of their peers who had substantial disabilities. We measured the extent to which the tutors used the constant time delay procedure correctly and the tutees' correct performance on the skills being taught.
Mark Wolery +3 more
openaire +1 more source
VLSI implementation of an efficient Fused Add-Multiply unit using Constant-time addition
2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS), 2015Digital Signal Processing (DSP) applications widely use complex arithmetic operations. This paper introduces an implementation of one of the complex arithmetic operations, the Fused Add-Multiply (FAM) operation. In general, a separate adder and a multiplier are used to perform Add-Multiply operation.
S. Durgadevi, R. Seshasayanan
openaire +1 more source