HORIZON HASKELLDocslts/ghc-10.0.x8fef28d2026-11-02Search packagesCtrl K
Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 8fef28d · 2026-11-02

Modulecryptonite-0.30Haskell2010

Crypto.Number.Serialize.LE

Fast serialization primitives for integer (little endian)

Synopsis
  • Packagecryptonite-0.30
  • Exports4
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceLE.hs
valuei2osp :: ByteArray ba => Integer -> ba

i2osp converts a positive integer into a byte string.

The first byte is LSB (least significant byte); the last byte is the MSB (most significant byte)

valuei2ospOf :: ByteArray ba => Int -> Integer -> Maybe ba

Just like i2osp, but takes an extra parameter for size. If the number is too big to fit in len bytes, Nothing is returned otherwise the number is padded with 0 to fit the len required.

valuei2ospOf_ :: ByteArray ba => Int -> Integer -> ba

Just like i2ospOf except that it doesn't expect a failure: i.e. an integer larger than the number of output bytes requested.

For example if you just took a modulo of the number that represent the size (example the RSA modulo n).