Академический Документы
Профессиональный Документы
Культура Документы
matrices
Bay :Abdelhakim Chillali
June 7, 2009
1 Introduction
Public key cryptographic is the fundamental technology in secure communications.
It was devised by Diffie and Hellman in 1976 to secret key distribution. The mathe-
matical problems more used are the discrete logarithm problem (DLP). In 1985 the
elliptic curve discrete logarithm problem (ECDLP) was proposed independently by
Koblitz and Miller. In this paper, we present the hyperbolic curve discrete loga-
rithm problem as a new cryptographic scheme. Consider a finite field L = Fq with
characteristic p. where a, b ∈ L∗ , let x, y ∈ L, we denote:
L∗ multiplicatif group of L.
y
x
Myx = a −1 b −1 .
y x
b +1 a +1
G = {Myx det(Myx ) = 1}
Gq = G mod p.
Myx11 4Myx22 = Myx33
with: (
b2 x1 x2 +a2 y1 y2
x3 = ab2
(1) : x1 y2 +x2 y1
y3 = a
m = |Gq |
The next theorem whose proof is evident.
Theorem 1. The set Gq with the operator 4 defined by (1) is a abelien group.
The identity element is M0a , that if M = Myx then N = M−y x
is the inversible
element of M .
1
Remark 1. The HCDLP consists of following for two elements M, N ∈ Gq , deter-
mine the scaler k ∈ Zm such that M 4k = N . It is necessary that M be a generator
of the group Gq .
Assumption 1. Given a group Gq and tow elements M and N ∈ Gq , there exists
non polynomial time algorithm θ(logq) deciding the integer k such that M 4k = N
if such a k exists.
Assumption 2. Given a group Gq and θ(logq) elements Ni on Gq , there exists
non polynomial time algorithm (θ(logq)) deciding the integers ki , such that
4k
N14k1 4N24k2 4.......4Nθ(logq)
θ(logq)
=M
eα : P −→ C
Myx 7−→ eα (Mxy ) = Myx 4Mα
5)Function of decryption:∀α ∈ K ,
dα : C −→ P
Myx 7−→ dα (Mxy ) = Myx 4M−α
Remark 2.
dα oeα (Myx ) = Myx 4Mα 4M−α = Myx
Secret key :
α
Public keys:
Espace of lights P
Espace of quantified C
2
Espace of the keys K
Myx a generator of the group P
Fonction of coding eα
Fonction of deciphering dα
Remark 3. The Myxll , Myxtt and m are public and can known by another person,
but to obtain the private key α, it is necessary to solve the problem of the discrete
logarithm in Gq , what returns the discovery of the difficult key α.
3
Message received:
28 25 28 13 15 37 39 40
mr = { , , , }
27 30 17 30 39 17 1 0
Decryption:
Mxy d6 (Myx )
39 40
M28
18
1 0
15 37
M04
39 17
28 25
M34
36
27 30
28 13
M23
27
17 30
Remark 4.
15 13
logM31
26 M
10 = 21 , logM31
26 M
23 = 13
Send to B:
Mαα+1
2
And calculation: 2 2
4l
Mα2α +2 2α +2
2 +2α+2 = M2α2 +α+1
Send to A: 2
2α +2
M2α 2 +α+1
And calculation: 2
α+1 4t
Mα2α +2
2 +2α+2 = Mα2
β = 2α2 + 2 + α2 + 2α + 2 = 2α + 1
2
eβ (Myx ) = Myx 4Mα2α +2
2 +2α+2
4
2
2α +2
dβ (Myx ) = Myx 4M2α2 +α+1
References
[1] Akiyama, K., Goto, A.:(2006). A Public-key Cryptosystem using Algebraic
Surfaces (Extended Abstract). PQCrypto Workshop Record.
[2] Akiyama, K., Goto, A.:(2008).An improvement of the algebric surface Public-
key Cryptosystem,Proceedings of SCIS.
[3] Miller, V.:(1986). Use of elliptic curves in cryptography, in:Advances in
cryptography-CRYPTO 85, Lecture Notes In Computer Science, vol. 218,
Springer-Verlag, 1986, pp. 417-426.
[4] Koblitz, N.:(1987). Elliptic Curve Cryptosystems, Mathematics of Computa-
tion 48 203-209.
5
[5] Joan-Josep, C., Francisco, F., José-Francisco, V., Antonio, Z.:(2006). A non-
lineear elliptic curve cryptosystem based on matrices, Mathematics of Compu-
tation 174 150-164.
Dept. of Mathematics. FST of fes
E-mail address: chil2007@voila.fr