Search
Search Results
-
Optimized quantum circuit implementation of SATURNIN for Grover’s algorithm
In 2019, SATURNIN a light-weighted block cipher was proposed for post-quantum security. In this research, we try to examine the security strength of...
-
A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields
The multiplicative complexity of an S-box over a finite field is the minimum number of multiplications needed to implement the S-box as an arithmetic...
-
Estimating feature importance in circuit network using machine learning
Identifying the feature of the circuit network is a crucial step to understanding the behavior of the Very Large Scale Integration (VLSI)....
-
Circuit simulation and image encryption based on a six-dimensional cellular neural network hyperchaotic system
This paper proposes a six-dimensional hyperchaotic system based on the Cellular Neural Networks (CNN) theory. Numerical analysis of the Lyapunov...
-
A new three-dimensional memristor chaotic circuit design and its application in image encryption
In recent years, memristors have received widespread attention due to their inherent nonlinear characteristics. To this end, a three-dimensional...
-
Circuit Bootstrap**: Faster and Smaller
We present a novel circuit bootstrap** algorithm that outperforms the state-of-the-art TFHE method with 9.9...
-
Reducing Garbled Circuit Size While Preserving Circuit Gate Privacy
This paper investigates efficient and confidential circuit garbling techniques. The primary contribution of this research is the introduction of...
-
Parameterized Complexity
We look at the basics of parameterized complexity. This is a method which seeks to find tractability by limiting some parameter in the input. We...
-
Evolving Complexity is Hard
Understanding the evolution of complexity is an important topic in a wide variety of academic fields. Implications of better understanding complexity...
-
Quantum circuit implementations of lightweight authenticated encryption ASCON
In this paper, we discuss the quantum circuit implementations of the lightweight authenticated encryption algorithm ASCON by using the NOT gates,...
-
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These...
-
Adaptively Secure MPC with Sublinear Communication Complexity
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In...
-
Enhanced Shor’s algorithm with quantum circuit optimization
Most researchers in the field of cryptography are very aware of attack possibilities from quantum computers. Large integer factorization remains a...
-
Distinguishing genelet circuit input pulses via a pulse detector
Chemical systems have the potential to direct the next generation of dynamic materials if they can be integrated with a material while acting as the...
-
Design and Realization of Encoders Based on Switching Circuit
With the rapid development of DNA nanotechnology, a variety of flexible molecular computing models and logic computing systems have been proposed and...
-
Optimized VLSI Circuit Partitioning and Testing Using ACO and BIST Architectures
Circuit partitioning, an essential strategy in physical design, involves dividing a circuit according to specific constraints to meet particular...
-
Some Structural Complexity
We develop some general results on computational complexity. We show that normal methods which relativize are insufficient to decide many natural...
-
Improved Circuit-Based PSI via Equality Preserving Compression
Circuit-based private set intersection (circuit-PSI) enables two parties with input set X and Y to compute a function f over the intersection set...
-
A power-efficient approximate approach to improve the computational complexity of coding tools in versatile video coding
Approximate computing is a technique for optimising algorithms while taking into account both application quality of service and computational...
