Results 11 to 20 of about 6,357 (206)

Criteria-Based Approach to Solving the Problem of Technological Regulation Rotary Combine [PDF]

E3S Web of Conferences, 2023
The task of technological adjustment of the working bodies of a rotary combine harvester is not trivial. The complexity of the task is due to the need to take into account a large number of signs (environmental factors and parameters of the technical ...
Dimitrov V.P., Nurutdinova I.N., Borisova L.V.   +2 more
doaj   +1 more source

Faster Bootstrapping via Modulus Raising and Composite NTT

Transactions on Cryptographic Hardware and Embedded Systems, 2023
FHEW-like schemes utilize exact gadget decomposition to reduce error growth and ensure that the bootstrapping incurs only polynomial error growth. However, the exact gadget decomposition method requires higher computation complexity and larger memory ...
Zhihao Li, Ying Liu, Xianhui Lu, Ruida Wang, Benqiang Wei, Chunling Chen, Kunpeng Wang   +6 more
doaj   +1 more source

Fast algorithm for computer complex number-theoretic transforms

Electronics Letters, 1977
A high-radix FFT algorithm for computing transforms over FFT, where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
I.S. Reed, K.Y. Liu, T.K. Truong
openaire   +1 more source

Area-Efficient Polynomial Multiplication Hardware Implementation for Lattice-based Cryptography [PDF]

Jisuanji gongcheng
Lattice-based post-quantum cryptography algorithms demonstrate significant potential in public-key cryptography. A key performance bottleneck in hardware implementation is the computational complexity of polynomial multiplication. To address the problems
XIE Jiaxing, PU Jinwei, FANG Weitian, ZHENG Xin, XIONG Xiaoming
doaj   +1 more source

Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT

Transactions on Cryptographic Hardware and Embedded Systems, 2020
NewHope-NIST is a promising ring learning with errors (RLWE)-based postquantum cryptography (PQC) for key encapsulation mechanisms. The performance on the field-programmable gate array (FPGA) affects the applicability of NewHope-NIST.
Neng Zhang, Bohan Yang, Chen Chen, Shouyi Yin, Shaojun Wei, Leibo Liu   +5 more
doaj   +1 more source

Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography

Transactions on Cryptographic Hardware and Embedded Systems, 2020
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera, Angshuman Karmakar, Ingrid Verbauwhede   +2 more
doaj   +1 more source

Glassy Nature of the Hard Phase in Inference Problems

Physical Review X, 2019
An algorithmically hard phase is described in a range of inference problems: Even if the signal can be reconstructed with a small error from an information-theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently ...
Fabrizio Antenucci, Silvio Franz, Pierfrancesco Urbani, Lenka Zdeborová   +3 more
doaj   +1 more source

Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme

Information
In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum attack ...
Binh Kieu-Do-Nguyen, Nguyen The Binh, Cuong Pham-Quoc, Huynh Phuc Nghi, Ngoc-Thinh Tran, Trong-Thuc Hoang, Cong-Kha Pham   +6 more
doaj   +1 more source

Information-Theoretic Data Discarding for Dynamic Trees on Data Streams

Entropy, 2013
Ubiquitous automated data collection at an unprecedented scale is making available streaming, real-time information flows in a wide variety of settings, transforming both science and industry.
Christoforos Anagnostopoulos, Robert B. Gramacy   +1 more
doaj   +1 more source

Blind method for discovering number of clusters in multidimensional datasets by regression on linkage hierarchies generated from random data.

PLoS ONE, 2020
Determining intrinsic number of clusters in a multidimensional dataset is a commonly encountered problem in exploratory data analysis. Unsupervised clustering algorithms often rely on specification of cluster number as an input parameter.
Osbert C Zalay
doaj   +1 more source