Results 1 to 10 of about 72,380 (161)
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 +1 more source
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
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
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
Modular Integer Arithmetic [PDF]
Formalized Mathematics, 2008 In this article we show the correctness of integer arithmetic based on Chinese Remainder theorem as described e.g. in [11]: Integers are transformed to finite sequences of modular integers, on which the arithmetic operations are performed. Retransformation of the results to the integers is then accomplished by means of the Chinese Remainder theorem ...
openaire +1 more source
Balancing act: Multivariate rational reconstruction for IBP
Nuclear Physics B, 2023 We address the problem of unambiguous reconstruction of rational functions of many variables. This is particularly relevant for recovery of exact expansion coefficients in integration-by-parts identites (IBPs) based on modular arithmetic.
A.V. Belitsky +2 more
doaj +1 more source
Computation of Odd Magic Square Using a New Approach with Some Properties [PDF]
Engineering and Technology Journal, 2012 Several aspects of magic square studies fall within the computations all universes. Experimented computation has reverted patterns, some of which have lead to analytic insight.
Shatha A. Al-Najjar +2 more
doaj +1 more source
Наука. Инновации. Технологии, 2022 The traditional way of building modular devices constructive postulates the need to include in the modular device bulky non-modular unit that is running a series-parallel op-erations of modular arithmetic.
Viljan Mavlutinovich Amerbaev +3 more
doaj