2019-01-22 12:28:18 -0500 | asked a question | Is it possible to use OAEP in Sagemath Hey guys, I was wondering if there is any padding module/function in Sagemath for OAEP padding. OAEP is used with RSA, but I am trying to check whether I can use it with a different public key cryptosystem. Cheers |

2018-12-11 10:36:53 -0500 | asked a question | F4 and F5 implementation in Sagemath Hi all, Is there an implementation in Sagemath for the F4 and F5 algorithms that relates to Grobner bases? I found something about libsingular:slimgb, however I am not 100% sure if it is the right algorithm. Could you please let me know? Thanks |

2018-12-03 05:02:37 -0500 | commented question | Trying to get the right inverse, not possible @rburing any idea on this? |

2018-11-29 12:33:06 -0500 | received badge | ● Commentator |

2018-11-29 12:33:06 -0500 | commented question | Trying to get the right inverse, not possible Also, just to make it easier: https://github.com/miguelmarco/DME/tr.... The implementation I am trying it taken from the file find m1 and m2 I am following the author's code so should be simillar from my point of view |

2018-11-29 12:22:13 -0500 | commented question | Trying to get the right inverse, not possible Sure, it can be found here: https://www.mat.ucm.es/~iluengo/DME/p.... Also, it has a section Code where you can see the C code. |

2018-11-29 10:18:44 -0500 | commented question | Trying to get the right inverse, not possible I have to add that normally, I would want both M1 and M2 to be invertible, which it is the case when e > 9. Although when e < 9 M1 or M2 are sometimes invertible, they are not both invertible at the same time. Best to try with e = 4 |

2018-11-29 09:54:30 -0500 | asked a question | Trying to get the right inverse, not possible Hey guys, I am working on a project and I am trying to find a matrix that is invertible using the following code: However, when e < 8, it always gives me that M1 is not invertible and I do not understand whether there is an issue in my logic or not. I am however able to compute the inverse of M1 but when I multiply it with M1, I expect the identity matrix, however this is not the case when e < 8. Please try with different values of e to see this happening. Please let me know if you manage to find anything. Thanks |

2018-11-24 09:45:14 -0500 | commented answer | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? The last part was the one I was looking for, thanks man :) |

2018-11-24 09:44:55 -0500 | received badge | ● Supporter (source) |

2018-11-24 09:26:41 -0500 | commented answer | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? What I am trying to do is to convert the finite field representation into a polynomial ring with boolean coefficients.
So let's take a finite field element: What I want to do is to look at this element as a polynomial ring element, so the above element will look like:
Polynomial: Is it possible to do it in this way? |

2018-11-24 08:08:46 -0500 | asked a question | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? Hey guys, I am trying to compute the groebner basis of a polynomial system that looks like this: However I get an error: 'Ideal_pid' object has no attribute 'groebner_basis' I am new to Sagemath so sorry if I misunderstand something. Also, how can I possibly make R to become a multivariate system by following the same structure, using an irreducible polynomial from GF(2) as presented in this code. Thanks guys :) |

2018-11-06 04:48:34 -0500 | asked a question | How to convert an Integer to a GF representation Hi, I would like to convert an Integer to a GF, however I do not seem to find anything about this or whether it is possible or not. I am using the following code: Thank you |

2018-11-02 09:56:31 -0500 | commented answer | How to solve raising a polynomial to the power of a number mod something Thanks for letting me know, solved it :) made my understand that I should look a bit more at my logic. I will mark this as the solution, however, the inverse was not the issue here. |

2018-11-02 06:54:08 -0500 | commented answer | How to solve raising a polynomial to the power of a number mod something It is not this: |

2018-11-01 12:35:30 -0500 | commented answer | How to solve raising a polynomial to the power of a number mod something It doesn't help, I want to be able to keep the exponent modulo such that it reduces when I multiply it with its inverse, as in Diffie Helman |

2018-11-01 09:56:09 -0500 | commented question | How to solve raising a polynomial to the power of a number mod something K is GF(2^48) and x is a vector of K elements |

2018-11-01 08:56:30 -0500 | commented question | How to solve raising a polynomial to the power of a number mod something Edited with the code. Sorry for my code being very messy |

2018-11-01 08:55:44 -0500 | received badge | ● Editor (source) |

2018-11-01 08:46:34 -0500 | asked a question | How to solve raising a polynomial to the power of a number mod something I want to raise the polynomial vec1[0] to the power of a number mod x (vec1[0])^Binv[0][0], however when I do that, I receive the following message: unsupported operand type(s) for &: 'sage.rings.finite_rings.integer_mod.IntegerMod_gmp' and 'int' When I change Binv[0][0] to be an integer, everything works fine, however, this is not what I want to achieve. Is there any workaround to this? |

2018-10-30 15:49:46 -0500 | received badge | ● Scholar (source) |

2018-10-26 10:39:23 -0500 | received badge | ● Student (source) |

2018-10-26 10:26:17 -0500 | asked a question | Creating a matrix that has elements part of a GF I am currently doing some implementation but I have something that I do not seem to find online and bugged me for a few hours: When I do this, it print 0, but given that I created it in GF(2^(e*2)), I believe it shouldn't. Because of this, when I try to get the inverse of this matrix, which is invertible, I do not get anything. Please let me know if you have any thoughts. |

2018-10-26 10:26:17 -0500 | asked a question | Question regarding matrix of GF I am currently doing some implementation but I have something that I do not seem to find online and bugged me for a few hours: e = 48; K = GF(2^e); KE = GF(2^(e*2)); A = matrix(KE,3,3); E11 = 24; E12 = 59; E21 = 21; E23 = 28; E32 = 29; E33 = 65; A[0,0] = 2^E11; A[0,1] = 2^E12; A[0,2] = 0; A[1,0] = 2^E21; A[1,1] = 0; A[1,2] = 2^E23; A[2,0] = 0; A[2,1] = 2^E32; A[2,2] = 2^E33; print A[2][1] When I do this, it print 0, but given that I created it in GF(2^(e*2)), I believe it shouldn't. Because of this, when I try to get the inverse of this matrix, which is invertible from what the author said, I do not get anything. Please let me know if you have any thoughts |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.