Results 11 to 20 of about 3,554 (146)
Modular Path Queries with Arithmetic [PDF]
Logical Methods in Computer Science, 2021 We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity.
Jakub Michaliszyn +2 more
doaj +5 more sources
Another look at some fast modular arithmetic methods
Journal of Mathematical Cryptology, 2009 In this work we re-examine a modular multiplication and a modular exponentiation method. The multiplication method, proposed by Hayashi in 1998, uses knowledge of the factorization of both N + 1 and N + 2 to compute a multiplication modulo N. If both N +
M Jason Hinek
exaly +2 more sources
Improved Plantard Arithmetic for Lattice-based Cryptography
Transactions on Cryptographic Hardware and Embedded Systems, 2022 This paper presents an improved Plantard’s modular arithmetic (Plantard arithmetic) tailored for Lattice-Based Cryptography (LBC). Based on the improved Plantard arithmetic, we present faster implementations of two LBC schemes, Kyber and NTTRU, running ...
Junhao Huang +6 more
doaj +3 more sources
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Cryptography, 2021 Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems, based on ...
Chithralekha Balamurugan +3 more
doaj +1 more source
Analysis of Modular Arithmetic [PDF]
ACM Transactions on Programming Languages and Systems, 2005 We consider integer arithmetic modulo a power of 2 as provided by mainstream programming languages like Java or standard implementations of C. The difficulty here is that, for w > 1, the ring Z m of integers modulo m = 2
Markus Müller-Olm, Helmut Seidl
openaire +1 more source
Efficient and fully simulated oblivious transfer protocol on elliptic curve
网络与信息安全学报, 2023 Oblivious transfer protocol, an important technology in secure multi-party computation, is the research hotspot on network and information security.Based on the bilinear pairs and the difficult problems on elliptic curves, an efficient 1-out-of-N ...
Jiashuo SONG +3 more
doaj +3 more sources
On the non-randomness of modular arithmetic progressions: a solution to a problem by V. I. Arnold [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We solve a problem by V. I. Arnold dealing with "how random" modular arithmetic progressions can be. After making precise how Arnold proposes to measure the randomness of a modular sequence, we show that this measure of randomness takes a simplified form
Eda Cesaratto +2 more
doaj +1 more source
Optical modular arithmetic [PDF]
SPIE Proceedings, 2014 Nanoscale integrated photonic devices and circuits offer a path to ultra-low power computation at the few-photon level. Here we propose an optical circuit that performs a ubiquitous operation: the controlled, random-access readout of a collection of stored memory phases or, equivalently, the computation of the inner product of a vector of phases with a
Dmitri S. Pavlichin, Hideo Mabuchi
openaire +2 more sources
An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
New Journal of Physics, 2023 Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states.
Yewei Yuan +6 more
doaj +1 more source
CoRR, 2023 We present a simple neural network that can learn modular arithmetic tasks and exhibits a sudden jump in generalization known as ``grokking''. Concretely, we present (i) fully-connected two-layer networks that exhibit grokking on various modular arithmetic tasks under vanilla gradient descent with the MSE loss function in the absence of any ...
openaire +2 more sources