We present an integrated circuit area efficient and high-speed FPGA implementation of scalar multiplication using a Vedic multiplier. Scalar multiplication is the most important operation in Elliptic Curve Cryptography (ECC), which is used for public key generation and the performance of ECC greatly depends on it. The scalar multiplier is designed over Galois Binary field GF(2 233) for field size=233-bit which is secured curve according to NIST. The performances of the proposed design are evaluated by comparing it with Karatsuba based scalar multiplier for area and delay. The results show that the proposed scalar multiplication using Vedic multiplier has consumed 22% less area on FPGA and has 12% less delay than Karatsuba, based scalar multiplier. The scalar multipliers coded in Verilog HDL, synthesize and simulated in Xilinx 13.2 ISE on Virtex6 FPGA.
This paper presents an area efficient and high-speed FPGA implementation of scalar multiplication using a Vedic multiplier. Scalar multiplication is the most important operation in Elliptic Curve Cryptography(ECC), which used for public key generation and the performance of ECC greatly depends on it. The scalar multiplication is multiplying integer k with scalar P to compute Q=kP, where k is private key and P is a base point on the Elliptic curve. The Scalar multiplication underlying finite field arithmetic operation i.e. addition multiplication, squaring and inversion to compute Q. From these finite field operations, multiplication is the most time-consuming operation, occupy more device space and it dominates the speed of Scalar multiplication. This paper presents an efficient implementation of finite field multiplication using a Vedic multiplier. The scalar multiplier is designed over Galois Binary field GF(2233) for field size=233-bit which is secured curve according to NIST. The performances of the proposed design are evaluated by comparing it with Karatsuba based scalar multiplier for area and delay. The results show that the proposed scalar multiplication using Vedic multiplier has consumed 22% less area on FPGA and also has 12% less delay, than Karatsuba, based scalar multiplier. The scalar multiplier is coded in Verilog HDL, synthesize and simulated in Xilinx 13.2 ISE on Virtex6 FPGA.
The demand for an online college job board network and its copy in relating college pupils and careervacancies Traditionally, career sites are used by talent managers for candid exploration and recruitment. This task is based on an employment portal organized for one of the well-known engineering campuses and is a variation of a job council designed precisely for campus students. Providing job introduction riding to the talents of students and services such as candidate filtering for companies to survey candidates will help learners and companies to find suitable aspirants for the job. We aim to be beneficial. Keywords— Natural Language Processing, Recruitment, Artificial Intelligence, Knowledge Base
Due to security concerns, the biometric trend is being used in many systems. Biometric authentication is a cheap, easy, and reliable technology for multi-factor authentication. Cryptosystems are one such example of using biometric data. However, this could be risky as biometric information is saved for authentication purposes. Therefore, voice biometric systems provide more efficient security and unique identity than commonly used biometric systems. Although, speech recognition-based authentication systems suffer from replay attacks. In this paper, we implement and analyze a text-independent voice-based biometric authentication system based on the randomly generated input text. Since the prompted text phrase is not known to the speaker in advance, it is difficult to launch replay attacks. The system uses Mel-Frequency Cepstrum Coefficients (MFCC) to extract speech features and Gaussian Mixture Models (GMM) for speaker modeling.
In a world where 90 percent of people travel by road, the safety of the same becomes of utmost importance. And two of the most major issues a road traveler faces are Potholes and speed breakers. The total number of road accident deaths due to potholes in 2018, 2019, and 2020 stood at 2015, 2140 and 1471, respectively. Although speed breakers are intended to prevent traffic accidents, 49.6 per cent of crashes still happen in areas where there are speed breakers. This paper aims to present a method for locating, identifying, and documenting speed breakers and potholes. The suggested method will employ driving information collected by various sensors, such as vibrations, jerks, bumps, changes in distance from the base of the vehicle, etc., to detect and then store the location of the object in an online database. Additionally, a stream of images of the object spotted will be simultaneously taken and uploaded to a server, to analyze using an Image Detection model. This model will facilitate the live detection of potholes and speed breakers more accurately than previous solutions. Once this data is added to a database, it will be effectively used by government agencies to repair the roads as well as by daily commuters to avoid the route with more obstacles, when the database is supplied to mapping services like Google Maps.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.