Journal articles: 'Gröbner bases application'

1

Xia, Shengxiang, and Gaoxiang Xia. "AN APPLICATION OF GRÖBNER BASES." Mathematics Enthusiast 6, no. 3 (July 1, 2009): 381–94. http://dx.doi.org/10.54870/1551-3440.1159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

HASHEMI, AMIR, and PARISA ALVANDI. "APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS." Journal of Algebra and Its Applications 12, no. 07 (May 16, 2013): 1350034. http://dx.doi.org/10.1142/s0219498813500345.

Full text

Abstract:

Norton and Sălăgean [Strong Gröbner bases and cyclic codes over a finite-chain ring, in Proc. Workshop on Coding and Cryptography, Paris, Electronic Notes in Discrete Mathematics, Vol. 6 (Elsevier Science, 2001), pp. 391–401] have presented an algorithm for computing Gröbner bases over finite-chain rings. Byrne and Fitzpatrick [Gröbner bases over Galois rings with an application to decoding alternant codes, J. Symbolic Comput.31 (2001) 565–584] have simultaneously proposed a similar algorithm for computing Gröbner bases over Galois rings (a special kind of finite-chain rings). However, they have not incorporated Buchberger's criteria into their algorithms to avoid unnecessary reductions. In this paper, we propose the adapted version of these criteria for polynomials over finite-chain rings and we show how to apply them on Norton–Sălăgean algorithm. The described algorithm has been implemented in Maple and experimented with a number of examples for the Galois rings.

APA, Harvard, Vancouver, ISO, and other styles

3

Kolesnikov, P. S. "Gröbner–Shirshov Bases for Replicated Algebras." Algebra Colloquium 24, no. 04 (November 15, 2017): 563–76. http://dx.doi.org/10.1142/s1005386717000372.

Full text

Abstract:

We establish a universal approach to solutions of the word problem in the varieties of di- and tri-algebras. This approach, for example, allows us to apply Gröbner–Shirshov bases method for Lie algebras to solve the ideal membership problem in free Leibniz algebras (Lie di-algebras). As another application, we prove an analogue of the Poincaré–Birkhoff–Witt Theorem for universal enveloping associative tri-algebra of a Lie tri-algebra (CTD!-algebra).

APA, Harvard, Vancouver, ISO, and other styles

4

BORISOV, A. V., A. V. BOSOV, and A. V. IVANOV. "APPLICATION OF COMPUTER SIMULATION TO THE ANONYMIZATION OF PERSONAL DATA: STATE-OF-THE-ART AND KEY POINTS." Программирование, no. 4 (July 1, 2023): 58–74. http://dx.doi.org/10.31857/s0132347423040040.

Full text

Abstract:

A new version of GInv (Gröbner Involutive) for computing involutive Gröbner bases is presented as a library in C++11. GInv uses object-oriented memory reallocation for dynamic data structures, such as lists, red-black trees, binary trees, and GMP libraries for arbitrary-precision integer calculations. The interface of the package is designed as a Python3 module.

APA, Harvard, Vancouver, ISO, and other styles

5

Ohsugi, Hidefumi, and Takayuki Hibi. "Prestable ideals and Sagbi bases." MATHEMATICA SCANDINAVICA 96, no. 1 (March 1, 2005): 22. http://dx.doi.org/10.7146/math.scand.a-14942.

Full text

Abstract:

In order to find a reasonable class of squarefree monomial ideals $I$ for which the toric ideal of the Rees algebra of $I$ has a quadratic Gröbner basis, the concept of prestable ideals will be introduced. Prestable ideals arising from finite pure posets together with their application to Sagbi bases will be discussed.

APA, Harvard, Vancouver, ISO, and other styles

6

Qiu, Jianjun, and Yuqun Chen. "Free Lie differential Rota–Baxter algebras and Gröbner–Shirshov bases." International Journal of Algebra and Computation 27, no. 08 (December 2017): 1041–60. http://dx.doi.org/10.1142/s0218196717500485.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Conca, A., E. De Negri, and E. Gorla. "Universal Gröbner Bases and Cartwright–Sturmfels Ideals." International Mathematics Research Notices 2020, no. 7 (April 25, 2018): 1979–91. http://dx.doi.org/10.1093/imrn/rny075.

Full text

Abstract:

Abstract The main theoretical contribution of the paper is the description of two classes of multigraded ideals named after Cartwright and Sturmfels and the study of their surprising properties. Among other things we prove that these classes of ideals have very special multigraded generic initial ideals and are closed under several operations including arbitrary multigraded hyperplane sections. As a main application we describe the universal Gröbner basis of the ideal of maximal minors and the ideal of 2-minors of a multigraded matrix of linear forms generalizing earlier results of various authors including Bernstein, Sturmfels, Zelevinsky, and Boocher.

APA, Harvard, Vancouver, ISO, and other styles

8

Gao, Xing, and Tianjie Zhang. "Averaging algebras, rewriting systems and Gröbner–Shirshov bases." Journal of Algebra and Its Applications 17, no. 07 (June 13, 2018): 1850130. http://dx.doi.org/10.1142/s021949881850130x.

Full text

Abstract:

In this paper, we study the averaging operator by assigning a rewriting system to it. We obtain some basic results on the kind of rewriting system we used. In particular, we obtain a sufficient and necessary condition for the confluence. We supply the relationship between rewriting systems and Gröbner–Shirshov bases based on bracketed polynomials. As an application, we give a basis of the free unitary averaging algebra on a nonempty set.

APA, Harvard, Vancouver, ISO, and other styles

9

Matsuda, Kazunori, Hidefumi Ohsugi, and Kazuki Shibata. "Toric Rings and Ideals of Stable Set Polytopes." Mathematics 7, no. 7 (July 10, 2019): 613. http://dx.doi.org/10.3390/math7070613.

Full text

Abstract:

In the present paper, we study the normality of the toric rings of stable set polytopes, generators of toric ideals of stable set polytopes, and their Gröbner bases via the notion of edge polytopes of finite nonsimple graphs and the results on their toric ideals. In particular, we give a criterion for the normality of the toric ring of the stable set polytope and a graph-theoretical characterization of the set of generators of the toric ideal of the stable set polytope for a graph of stability number two. As an application, we provide an infinite family of stable set polytopes whose toric ideal is generated by quadratic binomials and has no quadratic Gröbner bases.

APA, Harvard, Vancouver, ISO, and other styles

10

BOKUT, L. A., and A. A. KLEIN. "SERRE RELATIONS AND GRÖBNER-SHIRSHOV BASES FOR SIMPLE LIE ALGEBRAS II." International Journal of Algebra and Computation 06, no. 04 (August 1996): 401–12. http://dx.doi.org/10.1142/s0218196796000234.

Full text

Abstract:

Gröbner-Shirshov bases for the Lie algebras Bn, Cn, Dn, abstractly defined by generators and the Serre relations for the corresponding Cartan matrices over a field of characteristic ≠2, 3, are constructed. As an application, we obtain that each of the previous algebras is isomorphic to a classical simple Lie algebra so2n+1(k), sp2n(k), so2nk respectively.

APA, Harvard, Vancouver, ISO, and other styles

11

Sawada, Hiroyuki, and Xiu-Tian Yan. "Application of Gröbner bases and quantifier elimination for insightful engineering design." Mathematics and Computers in Simulation 67, no. 1-2 (September 2004): 135–48. http://dx.doi.org/10.1016/j.matcom.2004.05.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ioakimidis, N. I., and E. G. Anastasselou. "Application of Gröbner bases to problems of movement of a particle." Computers & Mathematics with Applications 27, no. 3 (February 1994): 51–57. http://dx.doi.org/10.1016/0898-1221(94)90046-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Huishi. "The General PBW Property." Algebra Colloquium 14, no. 04 (December 2007): 541–54. http://dx.doi.org/10.1142/s1005386707000508.

Full text

Abstract:

For ungraded quotients of an arbitrary ℤ-graded ring, we define the general PBW property, that covers the classical PBW property and the N-type PBW property studied via the N-Koszulity by several authors (see [2–4]). In view of the noncommutative Gröbner basis theory, we conclude that every ungraded quotient of a path algebra (or a free algebra) has the general PBW property. We remark that an earlier result of Golod [5] concerning Gröbner bases can be used to give a homological characterization of the general PBW property in terms of Shafarevich complex. Examples of application are given.

APA, Harvard, Vancouver, ISO, and other styles

14

Byrne, Eimear, and Patrick Fitzpatrick. "Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes." Journal of Symbolic Computation 31, no. 5 (May 2001): 565–84. http://dx.doi.org/10.1006/jsco.2001.0442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

BOKUT, L. A., and A. A. KLEIN. "SERRE RELATIONS AND GRÖBNER-SHIRSHOV BASES FOR SIMPLE LIE ALGEBRAS I." International Journal of Algebra and Computation 06, no. 04 (August 1996): 389–400. http://dx.doi.org/10.1142/s0218196796000222.

Full text

Abstract:

A Gröbner-Shirshov basis for the Lie algebra An, abstractly defined by generators hi, xi, yi, i=1,..., n and the Serre relations for the Cartan matrix An, over a field k of characteristic ≠2 is constructed. It consists of the Serre relations for An together with the following relations: [Formula: see text] with j≥1, i≥2, i+j≤n and the same relations for y1,…, yn, where by [z1z2…zm] we mean [z1[z2… zm]]. As an application we get a direct proof that An, as defined, is isomorphic to sℓn+1(k).

APA, Harvard, Vancouver, ISO, and other styles

16

Georg, Klein, and Zargeh Chia. "Operadic approach to HNN-extensions of Leibniz algebras." Quasigroups and Related Systems 30, no. 1(47) (May 2022): 101–14. http://dx.doi.org/10.56415/qrs.v30.08.

Full text

Abstract:

We construct HNN-extensions of Lie di-algebras in the variety of di-algebras and provide a presentation for the replicated HNN-extension of a Lie di-algebras. Then, by applying the method of Gröbner-Shirshov bases for replicated algebras, we obtain a linear basis. As an application of HNN-extensions, we prove that Lie di-algebras are embedded in their HNNextension.

APA, Harvard, Vancouver, ISO, and other styles

17

Mora, Teo, and Massimiliano Sala. "On the Gröbner bases of some symmetric systems and their application to coding theory." Journal of Symbolic Computation 35, no. 2 (February 2003): 177–94. http://dx.doi.org/10.1016/s0747-7171(02)00131-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Scheicher, Martin. "Gröbner bases and their application to the Cauchy problem on finitely generated affine monoids." Journal of Symbolic Computation 80 (May 2017): 416–50. http://dx.doi.org/10.1016/j.jsc.2016.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Chou, Shang-Ching, William F. Schelter, and Jin-Gen Yang. "An algorithm for constructing gröbner bases from characteristic sets and its application to geometry." Algorithmica 5, no. 1-4 (June 1990): 147–54. http://dx.doi.org/10.1007/bf01840382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

PAUER, FRANZ, and SANDRO ZAMPIERI. "Gröbner Bases with Respect to Generalized Term Orders and their Application to the Modelling Problem." Journal of Symbolic Computation 21, no. 2 (February 1996): 155–68. http://dx.doi.org/10.1006/jsco.1996.0007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Pauer, Franz, and Andreas Unterkircher. "Gröbner Bases for Ideals in Laurent Polynomial Rings and their Application to Systems of Difference Equations." Applicable Algebra in Engineering, Communication and Computing 9, no. 4 (February 1, 1999): 271–91. http://dx.doi.org/10.1007/s002000050108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Yildirim, Necmettin, Nurullah Ankaralioglu, Derya Yildrim, and Fatih Akcay. "Application of Gröbner Bases theory to derive rate equations for enzyme catalysed reactions with two or more substrates or products." Applied Mathematics and Computation 137, no. 1 (May 2003): 67–76. http://dx.doi.org/10.1016/s0096-3003(02)00084-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bokut, L. A., Yuqun Chen, and Abdukadir Obul. "Some new results on Gröbner–Shirshov bases for Lie algebras and around." International Journal of Algebra and Computation 28, no. 08 (December 2018): 1403–23. http://dx.doi.org/10.1142/s0218196718400027.

Full text

Abstract:

We review Gröbner–Shirshov bases for Lie algebras and survey some new results on Gröbner–Shirshov bases for [Formula: see text]-Lie algebras, Gelfand–Dorfman–Novikov algebras, Leibniz algebras, etc. Some applications are given, in particular, some characterizations of extensions of groups, associative algebras and Lie algebras are given.

APA, Harvard, Vancouver, ISO, and other styles

24

Huang, Juwei, and Yuqun Chen. "Gröbner–Shirshov Bases Theory for Trialgebras." Mathematics 9, no. 11 (May 26, 2021): 1207. http://dx.doi.org/10.3390/math9111207.

Full text

Abstract:

We establish a method of Gröbner–Shirshov bases for trialgebras and show that there is a unique reduced Gröbner–Shirshov basis for every ideal of a free trialgebra. As applications, we give a method for the construction of normal forms of elements of an arbitrary trisemigroup, in particular, A.V. Zhuchok’s (2019) normal forms of the free commutative trisemigroups are rediscovered and some normal forms of the free abelian trisemigroups are first constructed. Moreover, the Gelfand–Kirillov dimension of finitely generated free commutative trialgebra and free abelian trialgebra are calculated, respectively.

APA, Harvard, Vancouver, ISO, and other styles

25

Kelarev, Andrei, John Yearwood, and Paul Watters. "INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES." Asian-European Journal of Mathematics 03, no. 03 (September 2010): 435–42. http://dx.doi.org/10.1142/s1793557110000283.

Full text

Abstract:

This article is motivated by internet security applications of multiple classifiers designed for the detection of malware. Following a standard approach in data mining, Dazeley et al. (Asian-European J. Math. 2 (2009)(1) 41–56) used Gröbner-Shirshov bases to define a family of multiple classifiers and develop an algorithm optimizing their properties.The present article complements and strengthens these results. We consider a broader construction of classifiers and develop a new and more general algorithm for the optimization of their essential properties.

APA, Harvard, Vancouver, ISO, and other styles

26

Tran, Quoc-Nam, and Franz Winkler. "Special Issue on Applications of Gröbner Bases." Journal of Symbolic Computation 30, no. 4 (October 2000): 339–40. http://dx.doi.org/10.1006/jsco.1999.0410.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Liu, Jinwang, Dongmei Li, and Weijun Liu. "Some criteria for Gröbner bases and their applications." Journal of Symbolic Computation 92 (May 2019): 15–21. http://dx.doi.org/10.1016/j.jsc.2017.11.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Silva, Sérgio Ricardo Xavier da, Leizer Schnitman, and Vitalino Cesca Filho. "Analysis of computational efficiency for the solution of inverse kinematics problem of anthropomorphic robots using Gröbner bases theory." International Journal of Advanced Robotic Systems 18, no. 1 (January 1, 2021): 172988142198954. http://dx.doi.org/10.1177/1729881421989542.

Full text

Abstract:

This article presents an analysis of computational efficiency to solve the inverse kinematics problem of anthropomorphic robots. Two approaches are investigated: the first approach uses Paul’s method applied to the matrix obtained by the Denavit–Hartenberg algorithm and the second approach uses Gröbner bases theory. With each approach, the problem of inverse kinematics for an anthropomorphic robot will be solved. When comparing each method, this article will demonstrate that the method using Gröbner bases theory is more computationally efficient.

APA, Harvard, Vancouver, ISO, and other styles

29

BOKUT, L. A., YUQUN CHEN, and JIAPENG HUANG. "GRÖBNER–SHIRSHOV BASES FOR L-ALGEBRAS." International Journal of Algebra and Computation 23, no. 03 (April 16, 2013): 547–71. http://dx.doi.org/10.1142/s0218196713500094.

Full text

Abstract:

In this paper, we first establish Composition-Diamond lemma for Ω-algebras. We give a Gröbner–Shirshov basis of the free L-algebra as a quotient algebra of a free Ω-algebra, and then the normal form of the free L-algebra is obtained. Second we establish Composition-Diamond lemma for L-algebras. As applications, we give Gröbner–Shirshov bases of the free dialgebra and the free product of two L-algebras, and then we show four embedding theorems of L-algebras: (1) Every countably generated L-algebra can be embedded into a two-generated L-algebra. (2) Every L-algebra can be embedded into a simple L-algebra. (3) Every countably generated L-algebra over a countable field can be embedded into a simple two-generated L-algebra. (4) Three arbitrary L-algebras A, B, C over a field k can be embedded into a simple L-algebra generated by B and C if |k| ≤ dim (B * C) and |A| ≤ |B * C|, where B * C is the free product of B and C.

APA, Harvard, Vancouver, ISO, and other styles

30

Qiu, Jianjun, and Yuqun Chen. "Gröbner–Shirshov bases for Lie Ω-algebras and free Rota–Baxter Lie algebras." Journal of Algebra and Its Applications 16, no. 10 (September 20, 2017): 1750190. http://dx.doi.org/10.1142/s0219498817501900.

Full text

Abstract:

We generalize the Lyndon–Shirshov words to the Lyndon–Shirshov [Formula: see text]-words on a set [Formula: see text] and prove that the set of all the nonassociative Lyndon–Shirshov [Formula: see text]-words forms a linear basis of the free Lie [Formula: see text]-algebra on the set [Formula: see text]. From this, we establish Gröbner–Shirshov bases theory for Lie [Formula: see text]-algebras. As applications, we give Gröbner–Shirshov bases of a free [Formula: see text]-Rota–Baxter Lie algebra, of a free modified [Formula: see text]-Rota–Baxter Lie algebra, and of a free Nijenhuis Lie algebra and, then linear bases of these three algebras are obtained.

APA, Harvard, Vancouver, ISO, and other styles

31

Zerz, E. "Some Applications of Gröbner Bases in Multidimensional Systems Theory." ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik 81, S3 (2001): 635–36. http://dx.doi.org/10.1002/zamm.20010811593.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hillar, Christopher J., and Seth Sullivant. "Finite Gröbner bases in infinite dimensional polynomial rings and applications." Advances in Mathematics 229, no. 1 (January 2012): 1–25. http://dx.doi.org/10.1016/j.aim.2011.08.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Liu, Mulan, and Lei Hu. "Properties of Gröbner Bases and Applications to Doubly Periodic Arrays." Journal of Symbolic Computation 26, no. 3 (September 1998): 301–14. http://dx.doi.org/10.1006/jsco.1998.0213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Kubler, Felix, and Karl Schmedders. "Tackling Multiplicity of Equilibria with Gröbner Bases." Operations Research 58, no. 4-part-2 (August 2010): 1037–50. http://dx.doi.org/10.1287/opre.1100.0819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Bokut, L. A., Yuqun Chen, and Zerui Zhang. "Gröbner–Shirshov bases method for Gelfand–Dorfman–Novikov algebras." Journal of Algebra and Its Applications 16, no. 01 (January 2017): 1750001. http://dx.doi.org/10.1142/s0219498817500013.

Full text

Abstract:

We establish Gröbner–Shirshov base theory for Gelfand–Dorfman–Novikov algebras over a field of characteristic [Formula: see text]. As applications, a PBW type theorem in Shirshov form is given and we provide an algorithm for solving the word problem of Gelfand–Dorfman–Novikov algebras with finite homogeneous relations. We also construct a subalgebra of one generated free Gelfand–Dorfman–Novikov algebra which is not free.

APA, Harvard, Vancouver, ISO, and other styles

36

Qiu, Jianjun. "Gröbner–Shirshov bases for commutative algebras with multiple operators and free commutative Rota–Baxter algebras." Asian-European Journal of Mathematics 07, no. 02 (June 2014): 1450033. http://dx.doi.org/10.1142/s1793557114500338.

Full text

Abstract:

In this paper, the Composition-Diamond lemma for commutative algebras with multiple operators is established. As applications, the Gröbner–Shirshov bases and linear bases of free commutative Rota–Baxter algebra, free commutative λ-differential algebra and free commutative λ-differential Rota–Baxter algebra are given, respectively. Consequently, these three free algebras are constructed directly by commutative Ω-words.

APA, Harvard, Vancouver, ISO, and other styles

37

Zhiping Lin, L. Xu, and N. K. Bose. "A Tutorial on GrÖbner Bases With Applications in Signals and Systems." IEEE Transactions on Circuits and Systems I: Regular Papers 55, no. 1 (February 2008): 445–61. http://dx.doi.org/10.1109/tcsi.2007.914007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Gritzmann, Peter, and Bernd Sturmfels. "Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases." SIAM Journal on Discrete Mathematics 6, no. 2 (May 1993): 246–69. http://dx.doi.org/10.1137/0406019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Lin, Zhiping, Li Xu, and Qinghe Wu. "Applications of Gröbner bases to signal and image processing: a survey." Linear Algebra and its Applications 391 (November 2004): 169–202. http://dx.doi.org/10.1016/j.laa.2004.01.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Heyworth, Anne. "One-Sided Noncommutative Gröbner Bases with Applications to Computing Green's Relations." Journal of Algebra 242, no. 2 (August 2001): 401–16. http://dx.doi.org/10.1006/jabr.2001.8801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Ioakimidis, N. I., and E. G. Anastasselou. "Gröbner bases in truss problems with maple." Computers & Structures 52, no. 5 (September 1994): 1093–96. http://dx.doi.org/10.1016/0045-7949(94)90093-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

QIU, JIANJUN, and YUQUN CHEN. "COMPOSITION-DIAMOND LEMMA FOR λ-DIFFERENTIAL ASSOCIATIVE ALGEBRAS WITH MULTIPLE OPERATORS." Journal of Algebra and Its Applications 09, no. 02 (April 2010): 223–39. http://dx.doi.org/10.1142/s0219498810003859.

Full text

Abstract:

In this paper, we establish the Composition-Diamond lemma for λ-differential associative algebras over a field K with multiple operators. As applications, we obtain Gröbner–Shirshov bases of free λ-differential Rota–Baxter algebras. In particular, linear bases of free λ-differential Rota–Baxter algebras are obtained and consequently, the free λ-differential Rota–Baxter algebras are constructed by words.

APA, Harvard, Vancouver, ISO, and other styles

43

Steiner, Matthias Johann. "Solving Degree Bounds for Iterated Polynomial Systems." IACR Transactions on Symmetric Cryptology 2024, no. 1 (March 1, 2024): 357–411. http://dx.doi.org/10.46586/tosc.v2024.i1.357-411.

Full text

Abstract:

For Arithmetization-Oriented ciphers and hash functions Gröbner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gröbner basis algorithms is only understood for special cases, and it is needless to say that these cases do not apply to most cryptographic polynomial systems. Therefore, cryptographers have to resort to experiments, extrapolations and hypotheses to assess the security of their designs. One established measure to quantify the complexity of linear algebra-based Gröbner basis algorithms is the so-called solving degree. Caminata & Gorla revealed that under a certain genericity condition on a polynomial system the solving degree is always upper bounded by the Castelnuovo-Mumford regularity and henceforth by the Macaulay bound, which only takes the degrees and number of variables of the input polynomials into account. In this paper we extend their framework to iterated polynomial systems, the standard polynomial model for symmetric ciphers and hash functions. In particular, we prove solving degree bounds for various attacks on MiMC, Feistel-MiMC, Feistel-MiMC-Hash, Hades and GMiMC. Our bounds fall in line with the hypothesized complexity of Gröbner basis attacks on these designs, and to the best of our knowledge this is the first time that a mathematical proof for these complexities is provided. Moreover, by studying polynomials with degree falls we can prove lower bounds on the Castelnuovo-Mumford regularity for attacks on MiMC, Feistel-MiMC and Feistel-MiMCHash provided that only a few solutions of the corresponding iterated polynomial system originate from the base field. Hence, regularity-based solving degree estimations can never surpass a certain threshold, a desirable property for cryptographic polynomial systems.

APA, Harvard, Vancouver, ISO, and other styles

44

Sabzrou, Hossein. "A determinantal formula for circuits of integer lattices." Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica 20, no. 1 (January 1, 2021): 121–27. http://dx.doi.org/10.2478/aupcsm-2021-0008.

Full text

Abstract:

Abstract Let L be a not necessarily saturated lattice in ℤ n with a defining matrix B. We explicitly compute the set of circuits of L in terms of maximal minors of B. This has a variety of applications from toric to tropical geometry, from Gröbner to Graver bases, and from linear to binomial ideals.

APA, Harvard, Vancouver, ISO, and other styles

45

Iima, Kei-ichiro, and Yuji Yoshino. "Gröbner Bases for the Polynomial Ring with Infinite Variables and Their Applications." Communications in Algebra 37, no. 10 (October 9, 2009): 3424–37. http://dx.doi.org/10.1080/00927870802502878.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Ioakimidis, N. I., and E. G. Anastasselou. "Computer-based manipulation of systems of equations in elasticity problems with Gröbner bases." Computer Methods in Applied Mechanics and Engineering 110, no. 1-2 (December 1993): 103–11. http://dx.doi.org/10.1016/0045-7825(93)90022-p.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Shany, Yaron, and Amit Berman. "A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes." IEEE Transactions on Information Theory 68, no. 4 (April 2022): 2300–2318. http://dx.doi.org/10.1109/tit.2022.3140678.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Brickenstein, Michael, Alexander Dreyer, Gert-Martin Greuel, Markus Wedler, and Oliver Wienand. "New developments in the theory of Gröbner bases and applications to formal verification." Journal of Pure and Applied Algebra 213, no. 8 (August 2009): 1612–35. http://dx.doi.org/10.1016/j.jpaa.2008.11.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Liu, Mulan. "Applications of the theory of Gröbner bases to the study of linear recurring arrays." Chinese Science Bulletin 46, no. 14 (July 2001): 1149–51. http://dx.doi.org/10.1007/bf02900589.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Naumowicz, Adam. "Interfacing external CA systems for Gröbner bases computation in Mizarproof checking." International Journal of Computer Mathematics 87, no. 1 (January 2010): 1–11. http://dx.doi.org/10.1080/00207160701864459.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Gröbner bases application'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles