|
03 Aralık 2014, 13:00 
Gebze Teknik Üniversitesi Matematik Bölümü SeminerleriThe picard group of a graph - Efficient arithmetic, discrete logarithm and cryptography Stefan Hellbusch
In this talk we will discuss some details about the picard group of a graph and their applicability in cryptography. We illustrate the group with an unconstrained chip firing game and by using Dhar's Burning Algorithm we get an efficient arithmetic. We will see some examples and conclude, contrary to F. Shokrieh in [1], that there are graphs suitable for cryptography.
[1] Farbod Shokrieh, The monodromy pairing and discrete logarithm on the Jacobian of finite graphs, 2010
Grup Teorisi İngilizce Department of Mathematics, Building I, Seminar room. admin 20.03.2020 |
