# Tag Info

## New answers tagged implementation

1

A lot of companies use BSAFE: for a long time, BSAFE was the most successful supported cryptographic toolkits: it predates the success of open source software, it predates the availability of crypto APIs in operating systems, and it predates the expiration of patents on RSA and public-key cryptography in general. And it's always been a reliable, well-tested, ...

0

Take a look at tlslite, it offers an AES implementation. The API seems to support CBC mode only though. https://github.com/trevp/tlslite/blob/master/tlslite/utils/python_aes.py

3

You could, however the one part that doesn't translate in an obvious manner is the Galois field representation; you would need to pick a field representation for $GF(2^{256})$ and $GF(2^{512})$, because those have not be predefined for those sizes. Here's the issue; GCM does field multiplications internally; that is, it takes two $N$-bit vectors (where $N$ ...

0

As far as I can see you would have (at least) to define a wider polynomial for the multiplication over the GF(256) or GF(512) respectively (See point 2.5 Multiplication). It is unclear if you can do that without touching the overall security of the algorithm. I would not rely on the security of these modified algorithms without extensive research of the ...

Top 50 recent answers are included