One polynomials secret sharing scheme based on the elliptic curve

2005 International Symposium on Computer Science and Technology, ISCST 2005

Volumn , Issue , 2005, Pages 386-389

  Yin, Xinchun ^a   Wang, Caimei ^a   Wang, Yuanyuan ^a  

^a YANGZHOU UNIVERSITY   (China)

Author keywords

Elliptic curve discrete logarithm problem; Polynomial; Secret sharing scheme; Sub secret keys

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; SECRET SHARING SCHEMES; SUB-SECRET KEYS;

POLYNOMIALS;

EID: 84906847261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Sun qi. On a kind of trap and one-way function. Journal of SiChuan University (science and technology edition), 1985(4): 33-35
2. Cao Zhen-fu.On the Security of the RSA Based on a Polynomial Over Finite Fields Fp and a New Analog of the RSA. Journal on Communications, 1999, Vol 20 No.6: 15-18
3. Zhang Bin, Bai En-jian, Xiao Guo-zhen.On analog of the RSA.Joumal of XiDian University, 2002,Vol 29 No4: 518-521
4. Zhang Ping-po, Chen Cai-yun, Chen Lu-sheng, Chen Yan-ling.ElGamal cryptosystem and digital signature scheme based on polynomials over finite fields. Journal on Communications, 2005,Vol 26 No.5: 69-72
5. Yin Xin-chun, Wang Cai-mei. A Dynamic Secret Sharing Scheme Based on Elliptic Curve.The tenth national youth communication Academic Conference .2005,1013-1016
6. Blake, G Seroussi, N Smart.Elliptic Curves in Cryptography[M]. Cambridge, United Kingdom: Cambridge University Press, 1999.2-10
7. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Cryptology ePrint Archive, Report 2003/143, 2003. http://eprint.iacr.org/
8. P.S.L.M. Barreto, H.Y. Kim, B. Lynn and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - CRYPTO 2002, Springer LNCS 2442, 35469, 2002