#include <LengthAttack.h>
Inheritance diagram for LengthAttack_A1:
Public Member Functions | |
LengthAttack_A1 () | |
int | type () |
Returns the algorithm type. | |
findKey_LengthBasedResult | findKey_LengthBased (int N, const vector< Word > &A1, const vector< Word > &A2, const vector< Word > &B, int sec=9999999, ostream &out=cout) |
Attack on an instances of the AAG protocol. | |
Private Member Functions | |
int | sbgpGeneratorsWeight (const vector< Word > &A) |
void | addNewElt (const vector< Word > &A, set< ELT > &checkedElements, set< ELT > &uncheckedElements) |
void | tryElt (int N, const ELT &cur, const vector< Word > &B, set< ELT > &checkedElements, set< ELT > &uncheckedElements) |
bool | check_ifVectorsEqual (int N, const vector< Word > &A1, const vector< Word > &A2) |
This is a very basic version of the length-based attack which implements the best descend LBA where on each step we choose conjugator which gives the maximal decrease among all currently available tuples. See A.Myasnikov. A.Ushakov, "On the length-based attack" for more details.
Definition at line 66 of file LengthAttack.h.
|
Definition at line 69 of file LengthAttack.h. |
|
|
|
|
|
Attack on an instances of the AAG protocol. Executes a length-based attack on an instance of the AAG protocol
Implements LengthAttackBase. |
|
|
|
|
|
Returns the algorithm type.
Implements LengthAttackBase. Definition at line 70 of file LengthAttack.h. References AL1. |