Математические основы защиты информации. Ишмухаметов Ш.Т - 131 стр.

UptoLike

ВУЗ: 

КФУ | Казань

Составители: 

Рубрика: 

Список литературы 132
Список литературы
[1] Agrawal M. PRIMES is in P / M.Agrawal, N.Kayal, N.Saxena.– Annals of
Mathematics.– 2004, v.160, p. 781–793.
[2] Atkin A. Prime sieves using binary quadratic forms/ A. Atkin,
D. Bernstein.– http://cr.yp.to/papers/primesieves–19990826.pdf
[3] Berstein D. ECM using Edwards curves/ D. Berstein, P. Birkner, T.Lange,
C. Peters.–2008, p.1–40 http://eecm.cr.yp.to/eecm-20100616.pdf
[4] Berstein D. Faster addition and doubling on elliptic curves./ D. Berstein,
T.Lange. in AsiaCrypt’2007, p.29–50
[5] Berstein D. Explicit-formulas Database./ D. Berstein, T.Lange. 2007 http://
hyperelliptic.org/EFD
[6] Berstein D. Starfish on Strike/ D. Berstein, P. Birkner, T.Lange, C. Peters.–
LATINCRYPT 2010, edited by Michel Abdalla and Paulo S. L. M. Barreto.
Lecture Notes in Computer Science 6212. Springer, 2010, p.61–80
[7] Boldyreva A. Efficient Thresholf Signature, Multisignature and Blind Sig-
nature Schemes based on Diffie–Hellman–Group Signature Scheme. Cryp-
to’2003, Lect.Not.Comp.Sci., p.31–46
[8] Boneh D.,Franklin M. Identity based encrryption from the Weil pairing.
In J.Killan, editor, Proceeding of Crypto’2001, volume 2139, Lect.Notes in
Comp.Sci., 2001, p.213–229
[9] Brent R.P. Some integer factorization algorithms using elliptic curves/
R.P. Brent.– Austral.Comput.Sci.Comm, 1986, v.8, p. 149–163.
[10] Buhler J.P. Factoring integers with the number field sieve / J. P. Buhler,
H. W. Lenstra, C. Pomerance.– in The Developement of the Number Field
Sieve, Springer–Verlag, Berlin, Germany, 1993, p. 50–94.
[11] Chaum D. Zero-knowledge undeniable signatures. In I.Damgard, editor, Ad-
vances in Cryptology–Crypto’90, Lect.Not.Comp.Sci., v.740, 1992, p.89-105
Список литературы                                                            132

Список литературы
 [1] Agrawal M. PRIMES is in P / M.Agrawal, N.Kayal, N.Saxena.– Annals of
    Mathematics.– 2004, v.160, p. 781–793.

 [2] Atkin A.     Prime sieves using binary quadratic forms/ A. Atkin,
    D. Bernstein.– http://cr.yp.to/papers/primesieves–19990826.pdf

 [3] Berstein D. ECM using Edwards curves/ D. Berstein, P. Birkner, T.Lange,
    C. Peters.–2008, p.1–40 http://eecm.cr.yp.to/eecm-20100616.pdf

 [4] Berstein D. Faster addition and doubling on elliptic curves./ D. Berstein,
    T.Lange. in AsiaCrypt’2007, p.29–50

 [5] Berstein D. Explicit-formulas Database./ D. Berstein, T.Lange. 2007 http://
    hyperelliptic.org/EFD

 [6] Berstein D. Starfish on Strike/ D. Berstein, P. Birkner, T.Lange, C. Peters.–
    LATINCRYPT 2010, edited by Michel Abdalla and Paulo S. L. M. Barreto.
    Lecture Notes in Computer Science 6212. Springer, 2010, p.61–80

 [7] Boldyreva A. Efficient Thresholf Signature, Multisignature and Blind Sig-
    nature Schemes based on Diffie–Hellman–Group Signature Scheme. Cryp-
    to’2003, Lect.Not.Comp.Sci., p.31–46

 [8] Boneh D.,Franklin M. Identity based encrryption from the Weil pairing.
    In J.Killan, editor, Proceeding of Crypto’2001, volume 2139, Lect.Notes in
    Comp.Sci., 2001, p.213–229

 [9] Brent R.P.   Some integer factorization algorithms using elliptic curves/
    R.P. Brent.– Austral.Comput.Sci.Comm, 1986, v.8, p. 149–163.

[10] Buhler J.P. Factoring integers with the number field sieve / J. P. Buhler,
    H. W. Lenstra, C. Pomerance.– in The Developement of the Number Field
    Sieve, Springer–Verlag, Berlin, Germany, 1993, p. 50–94.

[11] Chaum D. Zero-knowledge undeniable signatures. In I.Damgard, editor, Ad-
    vances in Cryptology–Crypto’90, Lect.Not.Comp.Sci., v.740, 1992, p.89-105

Страницы