Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"Modular Multiplication"”.
-
Modular multiplication in the residue number system
… algorithms and hardware architectures for the modular multiplication Z = A × B mod M. This operation is the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography. The Residue Number System (RNS) is used to speed up long word length modular multiplication because …
-
Pipelined-Parallel Modular Multiplication and Key-Switching Accelerators for Homomorphic Encryption
Data privacy in the cloud computing era faces a fundamental paradox: digital information must typically be decrypted to be processed, exposing sensitive data to untrusted environments. Homomorphic Encryption (HE) offers a revolutionary solution by enabling arbitrary computation directly on …
-
INTERPLAY OF CHAOS AND INTEGRABILITY: FROM SHOR’S ALGORITHM TO SOLITONS
… a number by finding the periodicity of the modular multiplication operator. Quantum modular multiplication is related to classical Bernoulli map which is chaotic. However modular multiplication itself is periodic. It raises the question: is thereany signature of chaos in modular …
-
Parallel multipliers for modular arithmetic
Modular multiplication is a core operation in virtually all public-key cryptosystems in use today. In this research, parallel, high-speed designs for modular multiplication are presented. These high speed designs take advantage of the transistor bounty provided by Moore’s law and the continuously …
-
RSA in hardware
… the computations required, specifically the modular exponentiation operation that is required for RSA. A hardware implementation of the CIOS (Coarsely Integrated Operand Scanning) algorithm for modular multiplication is attempted on a XILINX Spartan3 FPGA in the TLL-5000 development platform …
-
Efficient Binary Field Multiplication on a VLIW DSP
… public-key cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities to optimize this operation in a heterogeneous multiprocessing platform such as TI OMAP3530. By migrating the long operand modular multiplication from a general-purpose ARM …
-
Design and synthesis of efficient circuits for quantum computers
… are effectively combined so as they can perform modular multiplication by constant in linear depth and space and consequently modular exponentiation in quadratic time and linear space. Modular exponentiation and modular multiplication operations are integral parts of the important quantum …
-
A high-speed integrated circuit with applications to RSA Cryptography
… The basic RSA cryptographic operation is a modular exponentiation where the modulus and exponent are integers typically greater than 500 bits long. Therefore, to obtain reasonable encryption rates using the RSA cipher requires that it be implemented in hardware. This thesis presents the …
-
Hardware and Software Multi-precision Implementations of Cryptographic Algorithms
… operations may include addition, subtraction, multiplication, division and exponentiation. Several research papers have been published providing different solutions to make these operations faster. Digital Signature Algorithm (DSA) is a cryptographic application that requires multi-precision …
-
Issues in Implementation of Public Key Cryptosystems
… for the coefficients of <em>f</em>(<em>t</em>). Modular multiplication using LWPFIs is performed in two phases: 1) polynomial multiplication in Z[<em>t</em>]/<em>f</em>(<em>t</em>) and 2) coefficient reduction. We present an efficient coefficient reduction algorithm based on a division algorithm …
-
Efficient hardware architecture for scalar multiplications on elliptic curves over prime field
… strategies to perform elliptic curve scalar multiplication, the fundamental operation in all ECC based crypto-systems. Finite field arithmetic is the bottleneck in the computation of the EC scalar multiplication operation. Especially, finite field multiplication is the most time-critical …
-
Rescheduled Montgomery Multiplication : digit level parallelism in serial architectures
… cryptographic protocols, RSA and ECC, employ modular multiplication on large integers or binary polynomial bit strings of hundreds or thousands of bits. The modulus may be an odd integer (usually prime), or an irreducible polynomial. Large products exceeding the value of the modulus must be …
-
Fast prime field arithmetic using novel large integer representation
… numbers comparison, addition/subtraction, modular addition/subtraction, modular reduction, multiplication, and modular multiplication. Extensive numerical simulations and software implementations are done to verify the performance of the new number representation. Results show that the …
-
Software and hardware implementation of the RSA public key cipher
… is examined. Methods for performing multiplication in hardware, with particular emphasis on the use of these methods in modular multiplication, are detailed. An algorithm for performing part of the encryption function in hardware and the hardware necessary for it is described. …
-
Σχεδιασμός κρυπτογραφικών συστημάτων δημοσίου κλειδιού
… an optimized version of Montgomery modulo multiplication algorithm is proposed for performing modular multiplication that employs Carry Save redundant logic and value precomputation. The resulting architecture is used in a modular exponentiation unit (which is the basic arithmetic operation …
-
Efficient Quantum Multiplication in the Quantum Fourier Transform Domain
… algorithms. Improvements made to a quantum multiplication algorithm could prove useful for different applications, such as modular multiplication in Shor's algorithm, or could play a role in the implementation of oracles for Grover's search algorithm. The designs presented in this thesis …
-
Countermeasures against hardware attack using power-based information leakage
… We performed SPICE simulations on Montgomery modular multiplication and Arithmetic-style multiplication using the FreePDK 45nm technology library. Another significant and developing issue is the need for security analysis on the EDA tool flow. In this work, the values and topologies of the …
-
Versatile architectures for cryptographic systems
… and design problems for the crucial operation of modular multiplication are presented. The new algorithms preserve the versatile characteristics discussed previously and it is proved that, along with existing algorithms in the literature, they may forma large family of algorithms applicable in …
-
Implementace modulární aritmetiky do obvodů FPGA a ASIC
Táto práca sa zaoberá analýzou, návrhom a implementáciou modulárnej aritmetiky do obvodov FPGA a ASIC. Jej hlavným cieľom je vytvoriť knižnicu syntetizovateľných funkcií v jazyku C++/SystemC pre operácie v modulárnej aritmetike s využitím Montgomeryho redukcie a porovnať výsledky implementácie s …
-
Návrh zabezpečení systému dálkového měření kvality dodávky elektrické energie
Bakalářská práce v první kapitole objasňuje pojem kvalita elektrické energie a některé její parametry. Dále jsou uvedeny používané systémy dálkového sběru dat a aktuální směr vývinu těchto systémů. Ve třetí kapitole jsou popsány symetrické a asymetrické kryptografické systémy a jejich hlavní …