HW/SW Implementation of MiRitH on Embedded Platforms

• URL: http://arxiv.org/abs/2411.12328v1
• Date: Tue, 19 Nov 2024 08:30:08 GMT
• Title: HW/SW Implementation of MiRitH on Embedded Platforms
• Authors: Maximilian Schöffel, Hiandra Tomasi, Norbert Wehn,
• Abstract summary: We present to the best of our knowledge the first design space exploration of MiRitH, a promising MPCitH algorithm, for embedded devices. We develop a library of mixed HW/SW blocks on the Xilinx ZYNQ 7000, and, based on this library, we explore optimal solutions under runtime or FPGA resource constraints. Our results show that MiRitH is a viable algorithm for embedded devices in terms of runtime and FPGA resource requirements.
• Score: 2.3099144596725574
• License:
• Abstract: Multi-Party Computation in the Head (MPCitH) algorithms are appealing candidates in the additional US NIST standardization rounds for Post-Quantum Cryptography (PQC) with respect to key sizes and mathematical hardness assumptions. However, their complexity presents a significant challenge for platforms with limited computational capabilities. To address this issue, we present, to the best of our knowledge, the first design space exploration of MiRitH, a promising MPCitH algorithm, for embedded devices. We develop a library of mixed HW/SW blocks on the Xilinx ZYNQ 7000, and, based on this library, we explore optimal solutions under runtime or FPGA resource constraints for a given public key infrastructure. Our results show that MiRitH is a viable algorithm for embedded devices in terms of runtime and FPGA resource requirements.

Related papers

• if-ZKP: Intel FPGA-Based Acceleration of Zero Knowledge Proofs [3.0009885036586725]
  We present a novel scalable architecture that is suitable for accelerating the zk-SNARK prover compute on FPGAs. We focus on the multi-scalar multiplication (MSM) that accounts for the majority of time spent in zk-SNARK systems. Our implementation runs 110x-150x faster compared to reference software library.
  arXiv  Detail & Related papers  (2024-12-17T02:35:32Z)
• MQT Qudits: A Software Framework for Mixed-Dimensional Quantum Computing [4.306566710489809]
  We introduce MQT Qudits, an open-source tool to assist in designing and implementing applications for mixed-dimensional qudit devices. We specify a standardized language for mixed-dimension systems and discuss circuit specification, compilation to hardware gate sets, efficient circuit simulation, and open challenges.
  arXiv  Detail & Related papers  (2024-10-03T18:00:01Z)
• Expressing and Analyzing Quantum Algorithms with Qualtran [0.06515015520518286]
  We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilations.
  arXiv  Detail & Related papers  (2024-09-06T22:24:59Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• FPGA-Placement via Quantum Annealing [1.1639171061272031]
  Field-Programmable Gate Arrays (FPGAs) have asserted themselves as vital assets in contemporary computing. The procedure of placement -- determining the optimal spatial arrangement of functional blocks on an FPGA to minimize communication delays and enhance performance -- is an NP-hard problem. In this paper, we re-formulate the placement problem as a series of so called unconstrained binary optimization (QUBO) problems which are subsequently solved via AQC.
  arXiv  Detail & Related papers  (2023-12-24T12:23:09Z)
• A native measurement-based QAOA algorithm, applied to the MAX K-CUT problem [0.0]
  Photonic quantum computers currently concur with gate-based platforms in the race towards useful quantum advantage. We propose an MBQC algorithm to run the Quantum Approximate Optimization Algorithm (QAOA) We conclude analyzing the resource-cost of our algorithm, compared to the case of translating a gate-based QAOA algorithm into MBQC rules showing up to a 30-fold improvement.
  arXiv  Detail & Related papers  (2023-04-07T10:23:28Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• HUSP-SP: Faster Utility Mining on Sequence Data [48.0426095077918]
  High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. We design a compact structure called sequence projection (seqPro) and propose an efficient algorithm, namely discovering high-utility sequential patterns with the seqPro structure (HUSP-SP) Experimental results on both synthetic and real-life datasets show that HUSP-SP can significantly outperform the state-of-the-art algorithms in terms of running time, memory usage, search space pruning efficiency, and scalability.
  arXiv  Detail & Related papers  (2022-12-29T10:56:17Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• MQBench: Towards Reproducible and Deployable Model Quantization Benchmark [53.12623958951738]
  MQBench is a first attempt to evaluate, analyze, and benchmark the and deployability for model quantization algorithms. We choose multiple platforms for real-world deployments, including CPU, GPU, ASIC, DSP, and evaluate extensive state-of-the-art quantization algorithms. We conduct a comprehensive analysis and find considerable intuitive or counter-intuitive insights.
  arXiv  Detail & Related papers  (2021-11-05T23:38:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.