登录
首页 » matlab » criptography-with-public-key-Mureche

criptography-with-public-key-Mureche

于 2011-07-01 发布 文件大小:80KB
0 239
下载积分: 1 下载次数: 7

代码说明:

  Cripting with public key....

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

发表评论

0 个回复

  • digital-filter
    利用超大规模集成电路技术实现高精度的A/D转换器通常采用过采样技术,该技术包括调制器和数字滤波两部分。(The use of VLSI technology to achieve high-precision A/D converters typically using oversampling technique including modulator and digital filter in two parts.)
    2013-07-20 15:15:16下载
    积分:1
  • final_stbc
    Computing the CDF and PDF of STBC
    2012-09-09 18:41:09下载
    积分:1
  • doneproject
    Visual cryptography for colored images full project in matlab code. Halftoning using jarvis method included.
    2015-03-29 14:14:23下载
    积分:1
  • TSP-GA
    说明:  使用ga解决tsp问题,使用attp48城市数据(Use GA to solve TSP problems and attP48 city data)
    2020-06-30 10:12:05下载
    积分:1
  • 815889771HVS
    这个代码描述了人类视觉系统的几个特性,希望能够对大家有帮助,共同进步!(This code described several characteristics of human visual system, the hope can to help, make progress together!)
    2010-11-09 20:12:25下载
    积分:1
  • Final
    To provide Security for the images which are being transmitted through Open communication
    2015-03-18 14:54:38下载
    积分:1
  • wordrecmatlabbyrf
    一个字符识别的matlab程序,包括细化,骨架提取,轮廓匹配等功能。(a Character Recognition of Matlab procedures, including thinning, skeleton extraction, contour matching function.)
    2006-10-28 14:31:14下载
    积分:1
  • dtmf
    • To design a GUI in MATLAB for Dual-Tone Multi-Frequency (DTMF) telephone key pad, including DTMF Signal generator and DTMF tone detector • To simulate the DTMF signals with noise based on the specifications given. • To decode and display the DTMF signals by using FFT algorithm
    2007-07-28 18:17:44下载
    积分:1
  • MATLABshejiyuyingyongjingdian
    《MATLAB程序设计与应用.iso》这可是最新版的教材上的配套光盘上的哦("MATLAB design and application procedures. Iso "But the latest version of the materials on CD-ROM supporting the oh)
    2007-04-09 02:09:54下载
    积分:1
  • Floyd
    从任意一条单边路径开始。所有两点之间的距离是边的权,或者无穷大,如果两点之间没有边相连。   2,对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。   3,不可思议的是,只要按排适当,就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
    2011-09-02 23:33:33下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载