Discrete logarithms for finite groups
LC Klingler, SS Magliveras, F Richman, M Sramka - Computing, 2009 - Springer
We present group-theoretic and cryptographic properties of a generalization of the
traditional discrete logarithm problem from cyclic to arbitrary finite groups. Questions related …
traditional discrete logarithm problem from cyclic to arbitrary finite groups. Questions related …
[PDF][PDF] A n2+ n MQV key agreement protocol.
In this paper, a novel scheme to generate (n2+ n) common secret keys in one session is
proposed, in which two parties can use them to encrypt and decrypt their communicated …
proposed, in which two parties can use them to encrypt and decrypt their communicated …
Cryptanalysis of some Nonabelian Group-Based Key Exchange Protocols
S Tinani, C Matteotti, J Rosenthal - arXiv preprint arXiv:2203.03525, 2022 - arxiv.org
In the recently emerging field of nonabelian group-based cryptography, a prominently used
one-way function is the Conjugacy Search Problem (CSP), and two important classes of …
one-way function is the Conjugacy Search Problem (CSP), and two important classes of …
[PDF][PDF] Cryptanalysis of the Cryptosystem Based on DLP gamma= alphaabetab.
M Sramka - Int. J. Netw. Secur., 2008 - ijns.jalaxy.com.tw
A critique of the proposed encryption scheme based on the DLP γ= αaβb is provided. It is
described how a plaintext can be obtained from a valid ciphertext by computing a single …
described how a plaintext can be obtained from a valid ciphertext by computing a single …
[PDF][PDF] Complexity of Conjugacy Search in some Polycyclic and Matrix Groups
S Tinani, C Matteotti, J Rosenthal - arXiv preprint arXiv …, 2022 - researchgate.net
The most prominent algorithmic problem employed in the recently emerging field of
nonabelian group-based cryptography is the Conjugacy Search Problem (CSP). While …
nonabelian group-based cryptography is the Conjugacy Search Problem (CSP). While …
[PDF][PDF] Solutions to the Conjugacy Search Problem in Various Platform Groups
S Tinani, C Matteotti, J Rosenthal - wcc2022.uni-rostock.de
Recently, the use of algorithmic problems over nonabelian groups was proposed for
constructing quantum-secure cryptosystems. The most prominent such problem is the …
constructing quantum-secure cryptosystems. The most prominent such problem is the …
[PDF][PDF] DHA: UM ESQUEMA DE ACORDO DE CHAVES BASEADO EM MATRIZES PARA O PROTOCOLO DIFFIE-HELLMAN
AGD UCHˆOA - 2007 - archivum.grupomarista.org.br
DHA: UM ESQUEMA DE ACORDO DE CHAVES BASEADO EM MATRIZES PARA O
PROTOCOLO DIFFIE-HELLMAN Page 1 ANDRE GUSTAVO DEGRAF UCHˆOA DHA: UM …
PROTOCOLO DIFFIE-HELLMAN Page 1 ANDRE GUSTAVO DEGRAF UCHˆOA DHA: UM …
[引用][C] Enhancing the security of Public key cryptosystem based on DLP [gamma][identical to][alpha]^ sup a^[Beta]^ sup b^(mod p)
C Meshram, SS Agrawal - International Journal of Research …, 2010 - search.proquest.com
cs_meshram@rediffmail.com 11 short Page 1 67 International Journal of Research and
Reviews in Computer Science (IJRRCS) Vol. 1, No. 4, December 2010 Enhancing the security …
Reviews in Computer Science (IJRRCS) Vol. 1, No. 4, December 2010 Enhancing the security …