Author:
Chintamani Mohan,Paul Prabal,Sa Laba
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics
Reference23 articles.
1. R.K.K. Ajeena and K. Hailiza, The computational complexity of elliptic curve integer sub-decomposition (ISD) method, AIP Conference Proceedings, 1605 (2014) 557-562.
2. M. Bahramian and K. Eslami, A new verifiable multi-secret sharing scheme based on elliptic curves and pairings, Italian Journal of Pure and Applied Mathematics, n 41 (2019) 456-468.
3. M. Belenkiy, Disjunctive multi-level secret sharing, IACR Cryptology ePrint Archive 18 (2008).
4. V.P. Binu and A. Sreekumar, Threshold Multi Secret Sharing Using Elliptic Curve and Pairing, International Journal of Information Processing, 9(4) (2015) 100-112.
5. J. Coron, Resistance against differential power analysis for elliptic curve cryptosystems, in Proceedings of the 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES ’99), vol. 1717 of Lecture Notes in Computer Science, pp. 292-302 Springer, (1999).