본문 바로가기
KERD
논문KCI 등재

A new representation algorithm in a free group

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

This paper presents a new representation algorithm which computes the representation for elements of a free group generated by two linear fractional transformations and also the justification of the algorithm in order to show how it operates correctly and efficiently according to inputs.

Abstract

This paper presents a new representation algorithm which computes the representation for elements of a free group generated by two linear fractional transformations and also the justification of the algorithm in order to show how it operates correctly and efficiently according to inputs.

참고문헌 (5)

  1. S. J. Choi, "Cryptanalysis of a homomorphic public-key cryptosystem over a finite group", 박사, pp.2006
  2. 최수정, "Representation Algorithms in Some Free Groups", 순수 및 응용수학, 15(3), pp.229~243 (2008), 한국수학교육학회
  3. S. J. Choi, "Cryptanalysis of a homomorphic public-key cryptosystem over a finite group", J. Math. Crypt., 1(4), pp.351~358 (2007)
  4. D. Grigoriev, "Homomorphic public key cryptosystems over groups and rings", Complexity of computations and proofs, Quad. Math., 13, pp.305~325 (2004)
  5. R. C. Lyndon, "Combinatorial Group Theory" (1977), Springer

관련 논문AI추천

이 간행물의 다른 논문 (14건)