在线时间:8:00-16:00
迪恩网络APP
随时随地掌握行业动态
扫描二维码
关注迪恩网络微信公众号
开源软件名称(OpenSource Name):somesocks/lua-lockbox开源软件地址(OpenSource Url):https://github.com/somesocks/lua-lockbox开源编程语言(OpenSource Language):Lua 99.0%开源软件介绍(OpenSource Introduction):
The Lua LockboxA collection of cryptographic primitives and protocols written in pure Lua. This was written to provide cross-platform, tested reference implementations of many different cryptographic primitives. These are written to be easy to read and easy to use, not for performance! Implemented PrimitivesDigests:
Message Authentication Codes (MACs):
Key Derivation Functions (KDFs):
Block Ciphers:
Block Cipher Modes:
Block Cipher Padding:
UsageTo use these cryptographic primitives in a project, you'll likely have to modify Lockbox.lua to change the module search path. All the primitives import this module to find the packages they require. See RunTests.lua as an example. The cryptographic primitives are designed to work on streams of bytes. There are three data structures used to help with this: Array(a Lua array of bytes), Stream(an iterator that returns a series of bytes), and Queue(a FIFO pipe of bytes). See Array.lua, Stream.lua, and Queue.lua for more details. Most cryptographic primitives are designed in a builder-style pattern. They usually have three functions: init, update, and finish. All of these functions will return the primitive, so you can chain functions calls together.
For examples of how to use the different primitives, read the test case files under tests. Security ConcernsSeveral weak or broken primitives are implemented in this library, for research or legacy reasons. These should not be used under normal circumstances! To restrict their usage, they have been marked as insecure, with the Lockbox.insecure() method. This will cause a failed assertion when you attempt to import the module, unless you set Lockbox.ALLOW_INSECURE to true before the import. For an example, see RunTests.lua. Modules names
Planned Updates
|
2023-10-27
2022-08-15
2022-08-17
2022-09-23
2022-08-13
请发表评论