2016
DOI: 10.1007/s13389-016-0139-0
|View full text |Cite
|
Sign up to set email alerts
|

Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Solving polynomial systems in general, whether in the commutative or noncommutative case, is a fundamental mathematical interest. In addition to computer algebra, it is used for numerous applications in sciences, for example in engineering [9], computer vision [38], economics [37], cryptology [53], algebraic geometry [61]. Also seen in many noncommutative cases, such as in cryptography [8], linear codes [6], robotics [30], etc.…”
Section: Introductionmentioning
confidence: 99%
“…Solving polynomial systems in general, whether in the commutative or noncommutative case, is a fundamental mathematical interest. In addition to computer algebra, it is used for numerous applications in sciences, for example in engineering [9], computer vision [38], economics [37], cryptology [53], algebraic geometry [61]. Also seen in many noncommutative cases, such as in cryptography [8], linear codes [6], robotics [30], etc.…”
Section: Introductionmentioning
confidence: 99%