登录
首页 » 加密解密 » COBRA cipher algorithm example.

COBRA cipher algorithm example.

于 2022-03-06 发布 文件大小:7.97 kB
0 173
下载积分: 2 下载次数: 1

代码说明:

COBRA cipher algorithm example.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • TEA介绍及数据算法之程序代码
    TEA介绍及数据加密算法之程序代码-TEA presentation and data encryption algorithm of the program code
    2022-08-11 01:36:49下载
    积分:1
  • DES算法及有关说明(HTM)
    DES加密算法及有关说明(HTM)-DES encryption algorithm and the (HTM)
    2022-02-02 19:39:09下载
    积分:1
  • 这是SLRC632的全部源代码.包括读typea typeb书..全功能支持
    这是SLRC632的全部源代码.包括读typea typeb书..全功能支持-This is the full source code SLRC632. Including reading books .. typea typeb full-function support
    2022-06-02 09:41:49下载
    积分:1
  • DES算法介绍 
    DES算法介绍 -DES algorithm introduced
    2022-06-17 17:24:26下载
    积分:1
  • 关于AES算法的释文档,是初学者的好帮手,有助于对AES算法的理...
    关于AES算法的解释文档,是初学者的好帮手,有助于对AES算法的理解-AES algorithm on the interpretation of documents, beginners are a good helper to help the understanding of the AES algorithm
    2022-09-16 13:15:03下载
    积分:1
  • aes算法C语言版,个人感觉比较好用的,欢迎大家下载
    aes算法C语言版,个人感觉比较好用的,欢迎大家下载-aes algorithm C language version, individuals feel relatively easy to use, and welcome everyone to download
    2022-01-26 05:12:21下载
    积分:1
  • title = Windows NT/2000/XP a RAM
    title=Windows NT/2000/XP 一个RAM-DISK文件系统驱动 memo=SwapFs is a driver for Windows NT/2000/XP that let you use a Linux swap partition for temporary storage, like a RAM-disk. It is possible to put Windows page file on it. It is implemented as a disk filter driver.-title = Windows NT/2000/XP a RAM-DISK file system driver memo = SwapFs is a driver for Windows NT/2000/XP that let you use a Linux swap partition for temporary storage, like a RAM-disk. It is possible to put Windows page file on it. It is implemented as a filter driver disk.
    2023-05-25 04:30:03下载
    积分:1
  • sspi_workbench
    sspi_workbench
    2022-07-19 06:43:43下载
    积分:1
  • IDEA symmetric algorithm software
    IDEA对称算法的软件实现-IDEA symmetric algorithm software
    2022-02-27 08:11:48下载
    积分:1
  • Well
    著名图论问题之一。邮递员从邮局出发送信,要求对辖区内每条街,都至少通过一次,再回邮局。在此条件下,怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法,故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.
    2022-06-01 03:25:54下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载