최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기情報保護學會誌 = KIISC review, v.16 no.4, 2006년, pp.15 - 24
한대완 (ETRI부설 국가보안기술연구소) , 염용진 (ETRI부설 국가보안기술연구소)
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
A. K. Lenstra, H. W. Lenstra, L. Lovasz, Facto-ring polynomials with rational coefficients, Mat-hematische Ann. 261:513-534, 1982
D. Micciancio, S. Goldwasser, Complexity of lattice problems: A Cryptographic perspective, Kluwer Academic Publishers, 2002
C.P. Schnorr, A hierarchy of polynomial lattice basis reduction algorithms, Theoretical Computer Science, 53:201-224, 1987
R. Merkle, M. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Tran. inform. theory, IT-24:525-530, September 1978
L. M. Adleman, On breaking generalized knapsack public key cryptosystems, 15th STOC, 402-412, ACM, 1983
E. F. Brickell, Solving low density knapsacks, Crypto'83, 25-37, Plenum Press, 1984
E. F. Brickell, Breaking iterated knapsacks, Crypto '84, LNCS 196, 342-358, Springer-Verlag, 1985
B. Chor, R. L. Rivest, A knapsack-type public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Inform. Theory, 34, 1988
D. Coppersmith, Finding a small root of a univariate modular equation, Eurocypt'96, LNCS 1070, 155-165, Springer-Verlag, 1996
D. Coppersmith, Finding a small root of a bivariate integer equation; Factoring with high bits known, Eurocypt '96, LNCS 1070, 178-189, Springer-Verlag, 1996
D. Coppersmith, Low-exponent RSA with related messages, Eurocypt'96, LNCS 1070, 1-10, Springer-Verlag, 1996
D. Boneh, G. Durfee, Cryptanalysis of RSA with private key d less than N 0.292, Eurocrypt'99, LNCS 1592, 1-11, Springer-Verlag, 1999
G. Durfee, P. Q. Nguyen, Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt'99, Asiacrypt 2000, LNCS 1976, 2000
A. May, Cryptanalysis of unbalanced RSA with small CRT-exponent, Crypto 2002, LNCS 2442, 242-256, Springer-Verlag, 2002
J. Blomer, A. May, New partial key exposure attacks on RSA, Crypto 2003, LNCS 2729, 27-43, Springer-Verlag, 2003
J. S. Coron, Finding small roots of bivariate integer polynomial equations revisited, Eurocrypt 2004, LNCS 3027, 492-505, Springer-Verlag, 2004
M. Ernst, Partial key exposure attacks on RSA up to full size exponents, Eurocrypt 2005, LNCS 3494, 371-386, Springer-Verlag, 2005
J. Blomer, A. May, A tool kit for finding small roots of bivariate polynomials over the integers, Eurocrypt 2005, LNCS 3494, 251-267, Springer-Verlag, 2005
V. Shoup, OAEP reconsidered, Crypto 2001, LNCS 2139, 239-259, Springer-Verlag, 2001
E. Fujisaki, T. Okamoto, D. Poincheval, J. Stern, RSA-OAEP is secure under the RSA assumption, Crypto 2001, LNCS 2139, Springer-Verlag, 2001
D. Boneh, Simplified OAEP for the RSA and Rabin functions, Crpyto 2001, LNCS 2139, 275-291, Springer-Verlag, 2001
A. May, Computing the RSA secret key is deterministic polynomial time equivalent to factoring, Crypto 2004, LNCS 3152, 213-219, Springer-Verlag, 2004
D. Boneh, R. Venkaesan, Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes, Crypto'96, LNCS 1109, 129-142, Springer-Verlag, 1996
P.Q. Nguyen, I. E. Shparlinski, The insecurity of the Digital Signature Algorithm with partially known nonces, J. of Cryptology, Vol 15(3), 151-176, 2002
I.E. Shparlinski, On the generalized hidden number problem and bit security of XTR, 14th Symp. on Appl. algebra, Algebraic Algorithms, and Error-Correcting Codes, LNCS 2227, 268-277, Springer-Verlag, 2001
D. Boneh, I. E. Shparlinski, On the unpredictability of bits of the elliptic curve Diffie-Hellman scheme, Crypto 2001, LNCS 2139, 201-212, Springer-Verlag, 2001
P.Q. Nguyen, The dark side of the hidden number problem: Lattice attacks on DSA, CCNT'99, Birkhauser, 2000
E. El Mahassni, P. Q. Nguyen, I. E. Sparlinski, The insecurity of Nyuberg-Rueppel and other DSA-like signature schemes with partially known nonces, CaLC 2001, LNCS 2146, 97-109, Springer-Verlag, 2001
P. Fouque, G. Poupard, On the security of RDSA, Eurocrypt 2003, LNCS 2656, 462-476, Springer-Verlag, 2003
P. Fouque, N. Howgrave-Graham, G. Marinet, G. Poupard, Insecurity of ESIGN in practical implementations, Asiacrypt 2003, LNCS 2894, 492-506, Springer-Verlag, 2003
M. Ajtai, Generating hard instance of lattice problems, 28th STOC, 99-108, ACM, 1996
M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/averagecase equivalence, 29th STOC, 284-293, ACM, 1997
P. Q. Nguyen, J. Stern, Cryptanalysis of the Ajtai-Dwork cryptosystem, Crypto'98, LNCS 1462, 223-242, Springer-Verlag, 1998
O. Goldreich, S. Goldwsser, S. Halevi, Public-key cryptosystems from lattice reduction problems, Crypto'97, LNCS 1294, 112-131, Springer-Verlag, 1997
P.Q. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto '97, Crypto'99, LNCS 1666, 288-304, Springer-Verlag, 1999
J. Hoffstein, J. Pipher, J.H. Silverman, NTRU: a ring based public key cryptosystem, ANTS III, LNCS 1423, 267-288, Springer-Verlag, 1998
D. Coppersmith, A. Shamir, Lattice attacks on NTRU, Eurocrypt'97, 52-61, Springer-Verlag, 1997
A. May, J.H. Silverman, Dimension reduction methods for convolution modular lattices, CaLC 2001, LNCS 2146, 110-125, 2001
J. Hoffstein, J.H. Silverman, W. Whyte, Estimated breaking times for NTRU lattices, Technical Reports #12, version 2, NTRU Cryptosystems, 2003
M. Szydlo, Hypercubic lattice reduction and analysis of GGH and NTRU signatures, Eurocrpyt 2003, LNCS 2656, 433-448, Springer-Verlag, 2003
P.Q. Nguyen, O. Regev, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, Eurocrypt 2006, LNCS 4004, 271-288, Springer-Verlag, 2006
N. Gama, N. Howgrave-Graham, P.Q. Nguyen, Symplectic lattice reduction and NTRU, Eurocrypt 2006, LNCS 4004, 233-253, Springer-Verlag, 2006
P.Q. Nguyen, J. Stern, The two faces of lattices in cryptology, CaLC 2001, LNCS 2146, 146-180, Springer-Verlag, 1998
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.