Kyle Juretus

Kyle Juretus

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 March 2022 in IEEE Computer Architecture Letters
Verified
Journal Article
Open access
BLBenjamin J. Lucas
Benjamin J. Lucas
AAAli Alwan
Ali Alwan
MMMarion Murzello
Marion Murzello
YTYazheng Tu
Yazheng Tu
PHPengzhou He
Pengzhou He
JXJiafeng Xie
Jiafeng Xie
Significant innovation has been made in the development of public-key cryptography that is able to withstand quantum attacks, known as post-quantum cryptography (PQC). This paper focuses on the development of an efficient PQC hardware implementation. Specifically, an implementation of the binary Ring-learning-with-errors (BRLWE)-based encryption scheme, a promising lightweight PQC suitable for resource-constrained applications, is proposed. The paper first develops the mathematical formulation to present the proposed algorithmic process. The corresponding hardware accelerators are then described in detail. Finally, comparisons with previous implementations are provided to demonstrate the superior performance of the proposed design. For instance, the proposed low-complexity accelerator has 34.7% less area-delay product (ADP) than the state-of-the-art design for $n=256$ in the field-programmable gate array (FPGA) platform. Apart from the efficiency of the hardware architectures, the proposed design also has a complete input/output processing setup, and thus is feasible for emerging lightweight applications.

12 May 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
KJKyle Juretus
Kyle Juretus
ISIoannis Savidis
Ioannis Savidis

17 April 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
KJKyle Juretus
Kyle Juretus
ISIoannis Savidis
Ioannis Savidis
Current out-of-cone logic locking methodologies provide resiliency against the satisfiability (SAT) attack with minimal corruption when comparing the outputs of an activated and locked integrated circuit (IC). In addition, the structure of the modifications to the original logic leaks functional information of the circuit, which allows an adversary to determine the correct key. A novel logic locking methodology, CORruption Adaptable Logic Locking (CORALL), is introduced in this paper that provides increased security against the SAT attack for modified logic cones that require a large corruption of the primary outputs of the circuit, where the corruption is quantified by comparing between an activated and locked state of the IC. In addition, the modifications to the logic cone utilized by CORALL provide increased resilience against structural attacks. The CORALL architecture increases the number of iterations required to successfully execute a SAT attack for a flip function with 20 inputs by 34.41x over SFLL-HD n/4 and 82.36x over SFLL-Flex. In addition, a protected-cube selection process based on iterative-cofactors is introduced, which provides varying logical functions of the perturb unit and maps portions of the logic of the perturb unit into the look-up tables (LUTs) of the CORALL architecture. The variation in the logical functions implemented by the perturb unit and the mapped functionality of the perturb unit into a LUT provide resistance to all current structural attacks on out-of-cone logic locking techniques.

28 February 2025 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SZSizhe Zhang
Sizhe Zhang
KJKyle Juretus
Kyle Juretus
XJXun Jiao
Xun Jiao
Brain-inspired hyperdimensional computing (HDC) is an emerging machine learning paradigm leveraging high-dimensional spaces for efficient tasks like pattern recognition and medical diagnostics. As a lightweight alternative to deep neural networks, HDC offers smaller model sizes, reduced computation, and memory-centric processing. However, deploying HDC in safety-critical applications, such as healthcare and robotics, is challenged by hardware-induced errors. This paper investigates HDC’s robustness to memory errors via extensive bit-flip injection experiments on item and associative memories. Results reveal that certain bit-flips severely degrade accuracy. To address this, we introduce the Hyperdimensional Bit-Flip Search (HD-BFS), a similarity-guided method for identifying vulnerabilities and crafting efficient attacks, where flipping just 6 critical bits—3.9% of random bit-flips—reduces accuracy to chance levels. We further propose Hyperdimensional Accelerated Bit-Flip Search (HD-ABFS), which narrows the search space by targeting critical dimensions and most significant bits (MSBs), achieving up to 282× speedup over HD-BFS. Finally, we develop an effective protection mechanism to enhance model safety. These insights highlight HDC’s resilience to random errors, offer robust defenses against targeted attacks, and advance the security and reliability of HDC systems.

27 June 2019 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
KJKyle Juretus
Kyle Juretus
ISIoannis Savidis
Ioannis Savidis
The resiliency of in-cone logic locking techniques to the satisfiability (SAT) attack is characterized in this paper. An analysis of the parameters of the SAT solver that impact security and a characterization of the effect netlist topology has on the security of the circuit is presented. The analysis of SAT solver parameters and logic structure is used to develop three novel logic locking gate selection algorithms based on maximum fanout free cones (MFFCs) and gate controllability for circuits implementing XOR, look-up table (LUT), and 2x1 MUX based logic obfuscation. The XOR, LUT, and MUX MFFC based algorithms resulted in an average increase of, respectively, 61.8%, 123.6%, and 38.5% in the minimum number of iterations required to complete the SAT attack across 1,000 different variable orderings of the netlist while applying the locking techniques to 5% of the gates within the netlist. In addition, the SAT attack resiliency and output corruption of the developed algorithms are compared with out-of-cone locking techniques.

30 December 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
KJKyle Juretus
Kyle Juretus
MAMoeness Amin
Moeness Amin
SHSyed Ali Hamza
Syed Ali Hamza
The paper examines neural network learning of the sparse array configurations in optimum beamforming. Unlike iterative greedy, convex, and global optimization methods for optimum array design, deep learning (DL) enables fast reconfigurations of the sparse array in rapid dynamic propagation environments. We employ three different convolutional neural network (CNN) architectures with varying simplification and parameter counts. The network is trained to select M out of N uniformly spaced antennas to achieve maximum signalto-interference and noise ratio (SINR) beamforming. Different values of M are considered, including N = 2M, for studying network performance under an increased number of subarray classes. We consider one desired source and one interference of arbitrary angle, and delineate the learning results for the two cases where the network is trained with the desired source assuming fixed and varying angles. We discuss the benefits of reducing the number of possible configurations due to sidelobe level reductions. It is also shown that the network performance significantly improves with data augmentations and by removing redundant array configurations which produce the same SINR.