2019-04-30 09:38:09 -0500 | received badge | ● Popular Question (source) |

2018-10-08 10:43:10 -0500 | received badge | ● Good Question (source) |

2018-08-15 06:45:15 -0500 | received badge | ● Popular Question (source) |

2018-06-26 00:32:49 -0500 | commented answer | HUGE delay in sage.crypto.sbox.SBox method nonlinearity() introduced in v.8.2 @asante Thank you for your update! |

2018-06-08 04:08:32 -0500 | received badge | ● Good Question (source) |

2018-06-07 14:40:12 -0500 | received badge | ● Nice Question (source) |

2018-06-06 08:51:14 -0500 | received badge | ● Nice Question (source) |

2018-06-06 07:16:11 -0500 | commented answer | HUGE delay in sage.crypto.sbox.SBox method nonlinearity() introduced in v.8.2 Please update us with the final resolution. Beside that, don't you think that the time needed (200 ms) for finding nonlinearity() of one vectorial boolean function (8 x 8) in SageMath 8.1 is too much, too? |

2018-06-05 00:40:20 -0500 | commented question | HUGE delay in sage.crypto.sbox.SBox method nonlinearity() introduced in v.8.2 I have updated the post with the code I have used to profile the slowdown. |

2018-06-04 05:23:32 -0500 | asked a question | HUGE delay in sage.crypto.sbox.SBox method nonlinearity() introduced in v.8.2 Average time in nonlinearity() in v.8.1. was Here is the code I have used in order to track the issue: Results from Sage 8.1 Results from Sage 8.2 |

2016-11-18 10:17:21 -0500 | received badge | ● Nice Question (source) |

2016-11-18 00:39:23 -0500 | commented answer | Memory leak when doing ANF of boolean functions? Thank you for the update! |

2016-11-18 00:37:25 -0500 | received badge | ● Scholar (source) |

2016-11-18 00:37:20 -0500 | received badge | ● Supporter (source) |

2016-11-17 07:44:49 -0500 | received badge | ● Editor (source) |

2016-11-17 07:44:25 -0500 | commented question | Memory leak when doing ANF of boolean functions? I confirm the same behavior under Sage version 7.4 |

2016-11-17 02:50:56 -0500 | asked a question | Memory leak when doing ANF of boolean functions? I am using SageMath version 7.2 (EDIT: I confirm the same behavior under Sage version 7.4) After each ANF call the memory used is |

2016-10-26 12:05:15 -0500 | received badge | ● Student (source) |

2016-10-26 09:16:13 -0500 | asked a question | About Boolean Function I want to find the Algebraic Normal Form of a boolean function. For example: Unfortunately, Algebraic Normal Form of this specific boolean function is not correct (x0 should be x3, x1 should be x2 and x2 should be x1). The answer of the ANF() method is in order='lex' (not as I desired in order = 'degneglex'). Furthermore, the ANF() form is calculated out of this ring (x0 involved?) How should I extract the ANF() in correct syntax (where x3>x2>x1)? |

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.