Modular arithmetic
Efficient Hardware Implementation of Modular Arithmetic and Group Operation Over Prime Field
... The following level in the hierarchy of an elliptic curve cryptosystem is an elliptic curve group operation i.e. point doubling (PD) and point addition (PA). The elements of these are the modular arithmetic ...
8
Faster Modular Arithmetic For Isogeny Based Crypto on Embedded Devices
... the modular arithmetic used in supersingular isogeny instantiated protocols can be acceler- ...this arithmetic instruction and accelerates the modular reduction in ...
16
Efficient Modular Arithmetic for SIMD Devices
... of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic ...for modular multiplications per second on a ...
15
FPGA Implementation of Mutual Authentication Protocol Using Modular Arithmetic
... Modulo arithmetic[1] is used as another approach to generate the Padgen function because of the scheme’s ...Modulo arithmetic does not require carry or borrow ...of arithmetic computation, and is a ...
7
An Impregnable Block Cipher Generation using Modern Transposition and Substitution Algorithms with a large Key, Modular Arithmetic and Integral Functions
... In this research, we have invented a method to generate the secure block cipher using modern transposition and substitution with 128bit key, modular and integral functions. This method supports an input in the ...
8
A MODERN ADVANCED HILL CIPHER INCLUDING A PAIR OF INVOLUTORY MATRICES AS MULTIPLICANDS AND INVOLVING A SET OF FUNCTIONS
... In this paper we have developed a block cipher by modifying the advanced Hill cipher which is based upon the concept of the involutory matrix. Here we have made use of transformations such as modular ...
12
(NIST ). The security
... the modular arithmetic operation which is a key operation in all the methods is not ...perform modular operation, normally trail division is used and the hardware implementation of such trail ...
5
The rational canonical form of a matrix
... An algorithm for the Exact Reduction of a Matrix to Frobenius Form Using Modular Arithmetic I, Math.. On Euclid’s Algorithm and the Computation of Polynomial Greatest Common Divisions, J[r] ...
8
A Novel Approach Toward Designing a Non-DHT Based Structured P2P Network Architecture
... Abstract ─ In this paper, we have applied modular arithmetic, specifically residue class (RC), to design a non-DHT-based structured P2P network. It is an interest based tree architecture. It is known as ...
7
Computational Reduction of Wilson's Primality Test for Modern Cryptosystems
... apply modular arithmetic to improve the original Wilson’s primality test method for reducing the computational complexity and getting a better area ...
6
Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm
... This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the ...
5
A High-Speed Data Transmission of an Redundant Signed Digit -Based Ecc Processor
... top or an irreducible polynomial. Various ECC processors had been proposed within the literature that both goal binary fields top fields or dual subject operations.Carry good judgment or embedded virtual sign processing ...
9
Fast Cryptography in Genus 2
... fast modular arithmetic: one based on the special form of the prime using “NIST-like” reduction [62] and another based on the special form of the prime when using Montgomery multiplication ...
28
E3: A Framework for Compiling C++ Programs with Encrypted Operands
... bit-level arithmetic (universal, but slower) and 2) modular arithmetic (faster, but not universal) within the same algorithm, which greatly improves performance of general-purpose programs processing ...
30
A Novel Block Cipher Involving a Key Bunch Matrix
... involving Modular Arithmetic and a Key on both sides of the Plaintext Matrix”, International Journal of Computational Intelligence and Information Security (IJCIIS), Special Issue, ...
6
Primality Testing Using Complex Integers and Pythagorean Triplets
... Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage ...
7
Bounds on the arithmetic degree : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Mathematics at Massey University
... Such problems include: finding upper and lower bounds for the arithmetic degree; studying the arithmetic degree under hypersurface section; and studying properties of the arithmetic degr[r] ...
56
An Efficient Multimedia DRM Technique using Secure Arithmetic Coding
... Thus, the most suitable domain for multimedia encryption is the entropy coding stage, where integration of encryption with en- tropy coding can be performed. Hence the joint encryption and compression of multimedia data ...
8
Radicals in arithmetic
... Groups of radicals over a field have the property that all finite subgroups (i.e., those consisting of roots of unity) are cyclic. This property is sufficient for the automorphism group [r] ...
121
Vol 11, No 5 (2020)
... Klir [2] introduced the interval arithmetic method of developing fuzzy arithmetic by triangular fuzzy numbers, where as in this paper, we have developed fuzzy arithmetic by trapezoidal[r] ...
6