Cryptography Reference
In-Depth Information
290. Misarsky, J.F.: A multiplicative attack using LLL algorithm on RSA signatures with
redundancy. In: Kaliski, B.S. Jr. (ed.) Advances in Cryptology—CRYPTO '97, Lecture
Notes in Computer Science, vol. 1294, pp. 221-234. Springer, Berlin (1997)
291. Monnet,
Y.,
Renaudin,
M.,
Leveugle,
R.:
Asynchronous
circuits
sensitivity
to
fault
injection.
In:
10th
IEEE
International
On-Line
Testing
Symposium
(IOLTS
2004),
pp. 121-128. IEEE Computer Society (2004)
292. Monnet, Y., Renaudin, M., Leveugle, R., Clavier, C., Moitrel, P.: Case study of a fault
attack on asynchronous DES crypto-processors. In: Breveglieri et al. [69], pp. 88-97
293. Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170),
519-521 (1985)
294. Montgomery, P.L.: Speeding up the Pollard and elliptic curve methods of factorization.
Math. Comput. 48(177), 243-264 (1987)
295. Moore, S.W., Anderson, R.J., Cunningham, P., Mullins, R., Taylor, G.: Improving smart
card security using self-timed circuits. In: 8th International Symposium on Asynchronous
Circuits and Systems (ASYNC 2002), pp. 211-218. IEEE Computer Society (2002)
296. Moradi, A., Shalmani, M.T.M., Salmasizadeh, M.: A generalized method of differential
fault attack against AES cryptosystem. In: Goubin and Matsui [167], pp. 91-100
297. Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-
subtraction chains. RAIRO Theor. Inform. Appl. 24, 531-543 (1990)
298. Muir, J.A.: Seifert's RSA fault attack: Simplified analysis and generalizations. In: Ning, P.,
Qing, S., Li, N. (eds.) Information and Communications Security (ICICS 2006), Lecture
Notes in Computer Science, vol. 4307, pp. 420-434. Springer, Berlin (2006)
299. Mukhopadhyay, D.: An improved fault based attack of the Advanced Encryption Standard.
In: Preneel, B. (ed.) Progress in Cryptology—AFRICACRYPT 2009, Lecture Notes in
Computer Science, vol. 5580, pp. 421-434. Springer, Berlin (2009)
300. Naccache, D., Nguyen, P.Q., Tunstall, M., Whelan, C.: Experimenting with faults, lattices
and the DSA. In: Vaudenay, S. (ed.) Public Key Cryptography—PKC 2005, Lecture Notes
in Computer Science, vol. 3386, pp. 16-28. Springer, Berlin (2005)
301. Nagel,
L.W.,
Pederson,
D.O.:
SPICE
(Simulation
Program
with
Integrated
Circuit
Emphasis).
Memorandum
ERL-M382
EECS
Department
University
of
California,
Berkeley (1973)
302. Nguyen, P.Q.: Can we trust cryptographic software? Cryptographic flaws in GNU Privacy
Guard v1.2.3. In: C. Cachin, J. Camenisch (eds.) Advances in Cryptology—EUROCRYPT
2004, Lecture Notes in Computer Science, vol. 3027, pp. 555-570. Springer, Heidelberg
(2004)
303. Nguyen, P.Q.: Public-key cryptanalysis. In: I. Luengo (ed.) Recent Trends in Cryptography,
Contemporary Mathematics, vol. 477, pp. 67-120. American Mathematical Society (2009)
304. Nguyen, P.Q., Shparlinski, I.: The insecurity of the digital signature algorithm with partially
known nonces. J. Cryptol. 15(3), 151-176 (2002)
305. Nguyen, P.Q., Shparlinski, I.: The insecurity of the elliptic curve digital signature algorithm
with partially known nonces. Des. Codes and Cryptogr. 30(2), 201-217 (2003)
306. Nguyen, P.Q., Stehlé, D.: LLL on the average. In: F. Hess, S. Pauli, M.E. Pohst (eds.)
Algorithmic Number Theory (ANTS-VII), Lecture Notes in Computer Science, vol. 4076,
pp. 238-256. Springer, Heidelberg (2006)
307. Nguyen, P.Q., Stern, J.: Merkle-Hellman revisited: A cryptoanalysis of the Qu-Vanstone
cryptosystem based on group factorizations. In: B.S. Kaliski Jr. (ed.) Advances in
Cryptology—CRYPTO '97, Lecture Notes in Computer Science, vol. 1294, pp. 198-212.
Springer, Heidelberg (1997)
308. Nguyen, P.Q., Stern, J.: Cryptanalysis of a fast public key cryptosystem presented at
SAC '97. In: S.E. Tavares, H. Meijer (eds.) Selected Areas in Cryptography (SAC '98),
Lecture Notes in Computer Science, vol. 1556, pp. 213-218. Springer, Heidelberg (1999)
309. Nicholson, W.K.: Introduction to Abstract Algebra. PWS Publishing Company, Boston
(1993)
