Sophie-Germain Counter Mode, an alternative to Galois Counter Mode (GCM) for systems lacking acceleration for polynomial multiplication.
Questions tagged [sgcm]
2 questions
4
votes
1 answer
How to handle the extra 12451 elements in Sophie-Germain Counter Mode?
In Sophie-Germain Counter Mode (SGCM), the $GF(2^{128})$ field multiplication of Galois Counter Mode (GCM) is replaced with normal multiplication $\bmod 2^{128}+12451$. Because the block size is 128 bits, the extra 12451 elements of the group do…
Myria
- 2,635
- 15
- 26
1
vote
1 answer
Is there a strong cryptographic reason for GCM's 2^39 - 256 bit limit, why Not 2^39
While examining the initial GCM specification by McGrew and Viega in 2005, it appears that the formation of the 128-bit Initialization Vector by combining a 96-bit nonce and a 32-bit unsigned wrapping counter seems somewhat random. This choice…
xyz
- 21
- 1