The Experts below are selected from a list of 1323 Experts worldwide ranked by ideXlab platform

Aravind Iyer - One of the best experts on this subject based on the ideXlab platform.

  • New algorithms for batch verification of standard ECDSA signatures
    Journal of Cryptographic Engineering, 2014
    Co-Authors: Sabyasachi Karati, Dipanwita Roychowdhury, Bhargav R. Bellur, Debojyoti Bhattacharya, Aravind Iyer
    Abstract:

    In this paper, several algorithms for batch verification of ECDSA signatures are studied. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. In order to improve the efficiency beyond what can be achieved by the naive algorithm, two new algorithms are proposed which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a Maximum Speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a Maximum Speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of the second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small ( $${\le }8$$ ≤ 8 ) batch sizes. The algorithms are also ported to the NIST Koblitz curves defined over fields of characteristic 2. This appears to be the first reported study on the batch verification of standard ECDSA signatures.

Sabyasachi Karati - One of the best experts on this subject based on the ideXlab platform.

  • New algorithms for batch verification of standard ECDSA signatures
    Journal of Cryptographic Engineering, 2014
    Co-Authors: Sabyasachi Karati, Dipanwita Roychowdhury, Bhargav R. Bellur, Debojyoti Bhattacharya, Aravind Iyer
    Abstract:

    In this paper, several algorithms for batch verification of ECDSA signatures are studied. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. In order to improve the efficiency beyond what can be achieved by the naive algorithm, two new algorithms are proposed which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a Maximum Speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a Maximum Speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of the second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small ( $${\le }8$$ ≤ 8 ) batch sizes. The algorithms are also ported to the NIST Koblitz curves defined over fields of characteristic 2. This appears to be the first reported study on the batch verification of standard ECDSA signatures.

  • AFRICACRYPT - Batch verification of ECDSA signatures
    Progress in Cryptology - AFRICACRYPT 2012, 2012
    Co-Authors: Sabyasachi Karati, Dipanwita Roychowdhury, Bhargav R. Bellur, Debojyoti Bhattacharya, Aravind V. Iyer
    Abstract:

    In this paper, we study several algorithms for batch verification of ECDSA signatures. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. We also propose two new and efficient algorithms which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a Maximum Speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a Maximum Speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of our second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small (≤8) batch sizes. To the best of our knowledge, this is the first reported study on the batch verification of original ECDSA signatures.

John Peck - One of the best experts on this subject based on the ideXlab platform.

  • On acceleration of the check tautology logic synthesis algorithm using an FPGA-based reconfigurable coprocessor
    Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186), 1997
    Co-Authors: Jason Cong, John Peck
    Abstract:

    We summarize our study on implementing tautology checking, a fundamental logic synthesis algorithm, using an FPGA based reconfigurable application specific coprocessor. The use of the tautology checking algorithm is first discussed followed by the specifics of hardware accelerator implementation and interface to application software. We compare our hardware accelerator for the tautology check algorithm with the software implementation of the tautology check algorithm in Espresso II (R. Rudell and A. Sangiovanni-Vincentelli, 1987). Our experimental results show that our accelerator is capable of achieving a Maximum Speedup factor of 2.94 and averaging 1.36 on 110 modified industry benchmarks included with the Espresso II package.

  • FCCM - On acceleration of the check tautology logic synthesis algorithm using an FPGA-based reconfigurable coprocessor
    Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186), 1997
    Co-Authors: Jason Cong, John Peck
    Abstract:

    We summarize our study on implementing tautology checking, a fundamental logic synthesis algorithm, using an FPGA based reconfigurable application specific coprocessor. The use of the tautology checking algorithm is first discussed followed by the specifics of hardware accelerator implementation and interface to application software. We compare our hardware accelerator for the tautology check algorithm with the software implementation of the tautology check algorithm in Espresso II (R. Rudell and A. Sangiovanni-Vincentelli, 1987). Our experimental results show that our accelerator is capable of achieving a Maximum Speedup factor of 2.94 and averaging 1.36 on 110 modified industry benchmarks included with the Espresso II package.

  • On Acceleration of Logic Synthesis Algorithms using FPGA-based Reconfigurable Coprocessors Technical Report: TR-970010
    1997
    Co-Authors: Jason Cong, John Peck
    Abstract:

    In this technical report, we present our studies on implementing two fundamental logic synthesis algorithms, tautology checking and binate covering, using an FPGA-based reconfigurable applicationspecific coprocessor. The uses of each algorithm are first discussed followed by the specifics of hardware accelerator implementation and interface to application software. We compare our hardware accelerator for the tautology check algorithm with the software implementation of the tautology check algorithm in Espresso II [RuVi87]. Our experimental results show that our accelerator is capable of achieving a Maximum Speedup factor of 2.94 and averaging 1.36 on 110 modified industry benchmarks included with the Espresso II package.

Hakan Lennerstad - One of the best experts on this subject based on the ideXlab platform.

  • an optimal lower bound on the Maximum Speedup in multiprocessors with clusters
    International Conference on Algorithms and Architectures for Parallel Processing, 1995
    Co-Authors: Lars Lundberg, Hakan Lennerstad
    Abstract:

    We consider an ideal multiprocessor system with q processors and a centralized scheduler without overhead that selects processes from one common pool, permitting dynamic relocation of processes. A parallel program P consisting of n processes is executed on this system and terminates when all processes are completed. Due to synchronizations, processes may be blocked while waiting for events in other processes. The parallel program is executed using some schedule of processes to processors, resulting in a Speedup /spl sigma/. We then consider an ideal multiprocessor with k clusters containing u processors each. In this system processes may not be relocated between clusters. Finding a schedule which results in Maximum Speedup is NP-hard. Here, we present a formula for the optimal lower bound on the Maximum Speedup for program P, as a function of q, n, /spl sigma/, k and u. We also present a formula for the optimal lower bound when the number of processes (n) is unknown. Using these results we are able to decide if a certain schedule is close to optimal or if it is worth-while to look for other schedules. This is demonstrated by evaluating the Speedup of a specific schedule of a particular program. >

Debojyoti Bhattacharya - One of the best experts on this subject based on the ideXlab platform.

  • New algorithms for batch verification of standard ECDSA signatures
    Journal of Cryptographic Engineering, 2014
    Co-Authors: Sabyasachi Karati, Dipanwita Roychowdhury, Bhargav R. Bellur, Debojyoti Bhattacharya, Aravind Iyer
    Abstract:

    In this paper, several algorithms for batch verification of ECDSA signatures are studied. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. In order to improve the efficiency beyond what can be achieved by the naive algorithm, two new algorithms are proposed which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a Maximum Speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a Maximum Speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of the second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small ( $${\le }8$$ ≤ 8 ) batch sizes. The algorithms are also ported to the NIST Koblitz curves defined over fields of characteristic 2. This appears to be the first reported study on the batch verification of standard ECDSA signatures.

  • AFRICACRYPT - Batch verification of ECDSA signatures
    Progress in Cryptology - AFRICACRYPT 2012, 2012
    Co-Authors: Sabyasachi Karati, Dipanwita Roychowdhury, Bhargav R. Bellur, Debojyoti Bhattacharya, Aravind V. Iyer
    Abstract:

    In this paper, we study several algorithms for batch verification of ECDSA signatures. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. We also propose two new and efficient algorithms which replace square-root computations by symbolic manipulations. Experiments carried out on NIST prime curves demonstrate a Maximum Speedup of above six over individual verification if all the signatures in the batch belong to the same signer, and a Maximum Speedup of about two if the signatures in the batch belong to different signers, both achieved by a fast variant of our second symbolic-manipulation algorithm. In terms of security, all the studied algorithms are equivalent to standard ECDSA* batch verification. These algorithms are practical only for small (≤8) batch sizes. To the best of our knowledge, this is the first reported study on the batch verification of original ECDSA signatures.