Advertisement

Algebraic methods for constructing asymmetric cryptosystems

  • Hideki Imai
  • Tsutomu Matsumoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Diffie, W. and Hellman, M.E.: “New directions in cryptography,” IEEE Trans. on Information Theory, Vol.IT-22, No.6, pp.644–654 (Nov. 1976).Google Scholar
  2. [2]
    Rivest, R.L., Shamir, A. and Adleman, L.: “A method of obtaining digital signatures and public key cryptosystems,” Comm. ACM, Vol.21, No.2, pp.120–126 (Feb.1978).Google Scholar
  3. [3]
    McEliece,R.: “A public key cryptosystem based on algebraic coding theory,” DSN Progress Rep.42–44, Jet Propulsion Lab. Calif.Inst.of Tech. (Jan.,Feb. 1978).Google Scholar
  4. [4]
    Matsumoto,T. and Imai,H.: “A new algorithm for public-key crypto-system,” Paper of Technical Group, TGIT82-24, IECE Japan (Aug. 1982) (in Japanese).Google Scholar
  5. [5]
    Matsumoto,T. and Imai,H.: “A public-key cryptosystem based on polynomials over finite fields of characteristic 2,” Proc.of the 5th Symposium on Information Theory and its Applications, pp.372–379 (Oct. 1982) (in Japanese).Google Scholar
  6. [6]
    Matsumoto,T.: “Mathematical cryptography and security of communication networks,” Thesis for M.E., Yokohama National University (Mar. 1983)(in Japanese).Google Scholar
  7. [7]
    Matsumoto,T. and Imai.H.: “A class of asymmetric cryptosystems based on polynomials over finite rings,” 1983 IEEE International Symposium on Information Theory, Abstract of Papers, pp.131–132 (Sept. 1983).Google Scholar
  8. [8]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.: “Asymmetric cryptosystems using obscure representations of enciphering functions,” 1983 Natl. Conf. Rec. on Inf. Syst., IECE Japan, S8-5 (Sept. 1983) (in Japanese).Google Scholar
  9. [9]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.:“An asymmetric bijective cryptosystem using a system of polynomials in several indeterminates as a public key,” Proc.of the 6th Symposium on Information Theory and its Applications, pp.263–268 (Nov. 1983) (in Japanese).Google Scholar
  10. [10]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.:“An asymmetric bijective cryptosystem with public multivariate polynomials over GF(2),” Paper of Technical Group, TGAL83-77, IECE Japan (Mar. 1984) (in Japanese).Google Scholar
  11. [11]
    Delsarte,P., Desmedt,Y., Odlyzko,A. and Piret,P.: “Fast crypt-analysis of the Matsumoto-Imai public key scheme,” presented at EURO CRYPTO 84 (Apr. 1984).Google Scholar
  12. [12]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.: “A high-speed asymmetric cryptosystem with obscure public-keys,” Paper of Technical Group, TGAL84-83 (Mar. 1985)(in Japanese).Google Scholar
  13. [13]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.: “A cryptographically useful theorem on the connection between uni and multivariate polynomials,” Trans. IECE Japan, Vol.E68, No.3 (Mar. 1985).Google Scholar
  14. [14]
    Takeuchi,M. and Kaneko,T.: “An improved public-key cryptosystem using Galois extension ring GR(2m,k),” 1985 Natl.Conf.Rec., IECE Japan, 1442 (Mar. 1985)(in Japanese).Google Scholar
  15. [15]
    Matsumoto,T., Imai,H., Harashima,H. and Miyakawa,H.: “Asymmetric cryptosystems based on obscure representations over finite non-commutative groups,” Paper of Technical Group, TGCS85-28, IECE Japan (June 1985)(in Japanese).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Hideki Imai
    • 1
  • Tsutomu Matsumoto
    • 2
  1. 1.Division of Electrical and Computer EngineeringYokohama National UniversityYokohamaJapan
  2. 2.Department of Electrical EngineeringUniversity of TokyoTokyoJapan

Personalised recommendations