To obtain access to full text of journal and articles you must register!
- Article name
- Selection of the hidden discrete logarithm problem parameters for designing cryptoschemes
- Authors
- Moldovyan D. N., , mdn.spectr@mail.ru, St. Petersburg Electrotechnical Univeristy "LETI", St. Petersburg, Russia
Goryachev A. A., , alex_disp@gmail.com, St.-Petersburg Institute for Informatics and Automation of Russian Academy of Sciences, St.-Petersburg, Russia
Kupriyanov I. A., , ikuprijanov@gmail.com, St.-Petersburg State University for Waterway communications, St.-Petersburg, Russia
- Keywords
- difficult problem / discrete logarithm problem / non-commutative vector groups / finite matrix groups / cryptoscheme
- Year
- 2011 Issue 1 Pages 19 - 23
- Code EDN
- Code DOI
- Abstract
- There is considered a method for generating elements of the non-commutative finite groups Γ of the m×m matrices and four-dimension vectors over the finite ground field GF(p) for defining particular variants of the hidden discrete logarithm problem (HDLP) suitable for implementing the HDLP-based cryptoschemes that are secure against attacks using homomorphisms of the group Γ into the field GF(ps) for different values s, 1 ≤ s ≤ m.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
