On the use of nonequiprobability in a key generator for finding codes by the exhaustive search method

MaRDI QIDQ3590537zbMATH OpenFDO

Authors A. E. Abdrakhmanov, D. A. Baĭbatchaeva

Publication date 18 September 2010

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Algorithmic search in group theory
• scientific article; zbMATH DE number 4112524
• A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers
• Key generation of algebraic-code cryptosystems
• scientific article; zbMATH DE number 4199385

Cited in

(1)

• scientific article; zbMATH DE number 1260858 (Why is no real title available?)

This page was built for publication: On the use of nonequiprobability in a key generator for finding codes by the exhaustive search method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590537)