Results 241 to 250 of about 336,920 (287)
Some of the next articles are maybe not open access.
Area-Optimized Constant-Time Hardware Implementation for Polynomial Multiplication
IEEE Embedded Systems Letters, 2023This work presents a lightweight, FPGA-based hardware implementation for polynomial multiplication, which is the major bottleneck in the NTRU public-key cryptographic scheme. NTRU is a quantum-resilient, lattice-based key exchange cryptosystem and is currently a finalist in the ongoing National Institute of Standards and Technology post-quantum ...
Khan, Safiullah +4 more
openaire +3 more sources
Implementation of a constant‐time dynamic storage allocator
Software: Practice and Experience, 2007AbstractThis paper describes the design criteria and implementation details of a dynamic storage allocator for real‐time systems. The main requirements that have to be considered when designing a new allocator are concerned with temporal and spatial constraints.
Masmano M. +4 more
openaire +1 more source
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
Pseudo Constant Time Implementations of TLS Are Only Pseudo Secure
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018Today, about 10% of TLS connections are still using CBC-mode cipher suites, despite a long history of attacks and the availability of better options (e.g. AES-GCM). In this work, we present three new types of attack against four popular fully patched implementations of TLS (Amazon's s2n, GnuTLS, mbed TLS and wolfSSL) which elected to use "pseudo ...
Eyal Ronen +2 more
openaire +1 more source
Fast constant time implementations of ZUC-256 on x86 CPUs
2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC), 2019ZUC-256 is a Pseudo Random Number Generator (PRNG) that is proposed as a successor of ZUC-128. Similarly to ZUC-128 that is incorporated in the 128-EEA3 and 128-EIA3 encryption and integrity algorithms, ZUC-256 is designed to offer 256-bit security and to be incorporated in the upcoming encryption and authentication algorithm in 5G technologies.
Nir Drucker, Shay Gueron
openaire +1 more source
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.
A. Louri, J.A. Hatch, null Jongwhoa Na
openaire +1 more source
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 +1 more source
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.
Barthe, Gilles +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.
Barthe, Gilles +5 more
openaire +2 more sources
2021 IEEE European Symposium on Security and Privacy (EuroS&P), 2021
We present the first side-channel attack on full-fledged smartphones that recovers the elliptic curve secret scalar from the electromagnetic signal that corresponds to a single scalar-by-point multiplication in current versions of Libgcrypt, OpenSSL, HACL* and curve25519-donna.
Alam, M. +7 more
openaire +2 more sources
We present the first side-channel attack on full-fledged smartphones that recovers the elliptic curve secret scalar from the electromagnetic signal that corresponds to a single scalar-by-point multiplication in current versions of Libgcrypt, OpenSSL, HACL* and curve25519-donna.
Alam, M. +7 more
openaire +2 more sources