Result 1 to 20 of 145 total
Partial key exposure on RSA with private exponents larger than $N$. (English)
Ryan, Mark D. (ed.) et al., Information security practice and experience. 8th international conference, ISPEC 2012, Hangzhou, China, April 9‒12, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29100-5/pbk). Lecture Notes in Computer Science 7232, 369-380 (2012).
1
Fault analysis in cryptography. Foreword by Dan Boneh. (English)
Information Security and Cryptography. Berlin: Springer (ISBN 978-3-642-29655-0/hbk; 978-3-642-29656-7/ebook). xvi, 354~p. EUR~94.95/net; SFR~126.50; \sterling~85.00/hbk (2012).
2
On Quisquater’s multiplication algorithm. (English)
Naccache, David (ed.), Cryptography and security: From theory to applications. Essays dedicated to Jean-Jacques Quisquater on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-28367-3/pbk). Lecture Notes in Computer Science 6805, 3-7 (2012).
3
Security aspects in information technology. First international conference, InfoSecHiComNet 2011, Haldia, India, October 19‒22, 2011. Proceedings. (English)
Lecture Notes in Computer Science 7011. Berlin: Springer (ISBN 978-3-642-24585-5/pbk). xiv, 187~p. EUR~49.22 (2011).
4
Memory-constrained implementations of elliptic curve cryptography in co-$Z$ coordinate representation. (English)
Nitaj, Abderrahmane (ed.) et al., Progress in cryptology ‒ AFRICACRYPT 2011. 4th international conference on cryptology in Africa, Dakar, Senegal, July 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21968-9/pbk). Lecture Notes in Computer Science 6737, 170-187 (2011).
5
Notions and relations for RKA-secure permutation and function families. (English)
Des. Codes Cryptography 60, No. 1, 15-35 (2011).
6
How (not) to design strong-RSA signatures. (English)
Des. Codes Cryptography 59, No. 1-3, 169-182 (2011).
7
Binary huff curves. (English)
Kiayias, Aggelos (ed.), Topics in cryptology ‒ CT-RSA 2011. The cryptographers’ track at the RSA conference 2011, San Francisco, CA, USA, February 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19073-5/pbk). Lecture Notes in Computer Science 6558, 340-355 (2011).
8
Scalar multiplication on Weierstrass elliptic curves from co-$Z$ arithmetic (English)
J. Cryptographic Engineering 1, No. 2, 161-176 (2011).
9
Side-channel analysis (English)
Encyclopedia of Cryptography and Security (2nd Ed.), 1198-1204 (2011).
10
Memory-efficient fault countermeasures (English)
CARDIS, 84-101 (2011).
11
Binary huff curves (English)
CT-RSA, 340-355 (2011).
12
Memory-constrained implementations of elliptic curve cryptography in co-$Z$ coordinate representation (English)
AFRICACRYPT, 170-187 (2011).
13
Pairing-based cryptography ‒ Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13‒15, 2010. Proceedings. (English)
Lecture Notes in Computer Science 6487. Berlin: Springer (ISBN 978-3-642-17454-4/pbk). xiii, 467~p. EUR~66.34 (2010).
14
Huff’s model for elliptic curves. (English)
Hanrot, Guillaume (ed.) et al., Algorithmic number theory. 9th international symposium, ANTS-IX, Nancy, France, July 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14517-9/pbk). Lecture Notes in Computer Science 6197, 234-250 (2010).
15
Coordinate blinding over large prime fields. (English)
Mangard, Stefan (ed.) et al., Cryptographic hardware and embedded systems ‒ CHES 2010. 12th international workshop, Santa Barbara, USA, August 17‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15030-2/pbk). Lecture Notes in Computer Science 6225, 443-455 (2010).
16
Co-$Z$ addition formulæ and binary ladders on elliptic curves. (Extended abstract). (English)
Mangard, Stefan (ed.) et al., Cryptographic hardware and embedded systems ‒ CHES 2010. 12th international workshop, Santa Barbara, USA, August 17‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15030-2/pbk). Lecture Notes in Computer Science 6225, 65-79 (2010).
17
Efficient arithmetic on Hessian curves. (English)
Nguyen, Phong Q. (ed.) et al., Public key cryptography ‒ PKC 2010. 13th international conference on practice and theory in public key cryptography, Paris, France, May 26‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13012-0/pbk). Lecture Notes in Computer Science 6056, 243-260 (2010).
18
The polynomial composition problem in $(\Bbb Z/n\Bbb Z)[X]$. (English)
Gollmann, Dieter (ed.) et al., Smart card research and advanced application. 9th IFIP WG 8.8/11.2 international conference, CARDIS 2010, Passau, Germany, April 14‒16, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12509-6/pbk). Lecture Notes in Computer Science 6035, 1-12 (2010).
19
Huff’s model for elliptic curves (English)
IACR Cryptology ePrint Archive 2010, 383 (2010).
20
Result 1 to 20 of 145 total
Start
Contact
Print
General Help
