Loading...
Search for: unknown-points
0.006 seconds

    Numerical Simulation of 2D Inviscid Compressible Magnetohydrodynamic Flows by Spectal Difference Method

    , M.Sc. Thesis Sharif University of Technology Kharratyan, Mahdi (Author) ; Hejranfar, Kazem (Supervisor)
    Abstract
    In the present study, the numerical solution of 2D inviscid compressible ideal magnetohydrodynamic (MHD) flows by using the spectral difference (SD) method on unstructured meshes is performed. The SD method combines the most desirable features of structured and unstructured grid methods to have computational efficiency and geometric flexibility to accurately compute flow over complex geometries. In the SD method, two sets of structured points, namely “unknown points” and “flux points”, are defined in each cell to support the reconstruction of given order of accuracy. The differential form of the conservation laws is satisfied at nodal unknown points while the flux derivatives expressed in... 

    Efficient Implementation of Elliptic Curve Scalar Multiplication without Division and Inversion Operations

    , M.Sc. Thesis Sharif University of Technology Mosanaei Bourani, Hatame (Author) ; Bayat-Sarmadi, Siavash (Supervisor)
    Abstract
    Elliptic curve cryptography (ECC) has received attention because it can achieve a security level similar to other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to other asymmetric methods, fast computation of ECC is always desirable. In this thesis,a fixed-base comb point multiplication method has been modified to perform regular point multiplication. Additionally, two low-complexity and lowlatency architectures for the modified point multiplication algorithm has been proposed. In order to achieve these architectures, a low-latency pipelined digit-level field multiplier for all national institute of standards and technology (NIST)... 

    Efficient Implementation of Elliptic Curve Cryptography on Curve-25519

    , M.Sc. Thesis Sharif University of Technology Rashidi Toghroljerdi, Zeinab (Author) ; Bayat Sarmadi, Siavash (Supervisor)
    Abstract
    Elliptic curve cryptography (ECC) has received attention because it can achieve a security level similar to other asymmetric methods while using a key with smaller length. Although ECC is more efficient compared to other asymmetric methods, fast computation of ECC is always desirable. In this thesis, a fixed-base comb point multiplication method has been modified to perform regular point multiplication. Additionally, two low-complexity and lowlatency architectures for the modified point multiplication algorithm has been proposed. In order to achieve these architectures, a low-latency pipelined digit-level field multiplier for all national institute of standards and technology (NIST)...