Voter authentication in general election is a very expensive and time-consuming issue. At present, identifying the voter is done through their voter ID cards in the presence of local people and this process leads to m...
详细信息
ISBN:
(纸本)9789811055447;9789811055430
Voter authentication in general election is a very expensive and time-consuming issue. At present, identifying the voter is done through their voter ID cards in the presence of local people and this process leads to malpractice and rigging. Some security algorithms are available in similar areas where identification is required. However, they are found to be failed in many situations. When compared to the existing system, proposed system will give better results by reducing security issues. This introduces concept of voter authentication using modified elliptic curve cryptography where the voter can be authentication over Internet by using public communication channel. Then he can cast his vote through Internet. Elliptic curve cryptography is a publickeycryptographic algorithm where it uses couple of keys as private and public. Private key is used by the voter and publickey is used to authenticate the voter. The private key in ECC is chosen by using cuckoo search optimization technique instead of randomly choosing the values. The proposed methodology is enhanced using live sample database and is found to be secured by all means.
Many public key cryptographic algorithms require modular multiplication of very large operands as their core arithmetic operation. One method to perform this operation reasonably fast is to use specialised hardware. H...
详细信息
Many public key cryptographic algorithms require modular multiplication of very large operands as their core arithmetic operation. One method to perform this operation reasonably fast is to use specialised hardware. However, larger sizes are often required to increase security. This comes at the expense of either reducing the clock rate or dramatically increasing the size and hence the cost of the system. Therefore, techniques that allow efficient and fast computation of this operation at the algorithmic level are desired. An algorithm/structure for the computation of Montgomery's modular multiplication is presented. The modified algorithm splits the original algorithm into two multiplication operations, which can be executed in parallel. The derived architectures can be pipelined to the bit-level by interleaving multiple modular multiplication operations onto the same structure.
暂无评论