CE235 Transposition Cipher

 Assignment One: Implementation of Autokey Cipher and Row Transposition Cipher CE235 Assignment One

2024-2025

University of Essex

1. Task of Assignment One

The aim of Assignment One is to write a Python program, which will implement the Autokey cipher and the Row transposition cipher. The introduction of the two ciphers can be found from the lecture notes.

Specifically, this assignment task is expected to do the following:

§ Design (with flowcharts) and develop a Python program with encryption and decryption functions for Autokey

cipher and the Row transposition cipher.

§ For the Row transposition cipher, if the length of the plaintext message (number of letters in message) is not

multiple times of the key length, you can add several letters to the end of the message before encryption, and delete these added letters after decryption to recover the original message.

A sample Python program caesar.py for Caesar cipher is provided for reference. The sample Python program can be run with default demo message and key from the command line in Terminal window like this:

python caesar_ciphyer.py

This reference program caesar_ciphyer.py encrypts a given message and then performs decryption. After the caesar_ciphyer.py program is run, it will display the plaintext, ciphertext, and the decrypted plaintext. If the cipher works correctly, the plain text and decrypted text should be the same.

Your program for these two ciphers should have a name like ak_registrationnumber.py (replace registrationnumber with your own registration number). Your program must run from command line like this (with a registration number 123456) :

python ak_123456.py

The outputs of ak_registrationnumber.py (including the key, plaintext, ciphertext and decrypted text) are required to be

displayed, following the display format given in the reference program caesar_ciphyer.py. 2. How to submit

Submit one python program file to Faser with the following filename (replace registration number by your own one):

ak_registrationnumber.py

Submission deadline is Wednesday, 04/12/2024 (UK time: 23:59); Beijing time: Thursday, 7:59, 05/12/2024.

3. Marking Scheme

There are 12 marks for this assignment (out of 100 marks for the overall module marks).

1) Flowcharts for the Autokey cipher and the Row transposition cipher take 1 mark each. The functions for the Autokey

cipher and the Row transposition cipher take 5 marks and 5 marks, respectively.

2) You will be asked by Professor He or the teaching assistants at NWU to demonstrate your work (including flowcharts

and program) and answer some questions to ensure it is your own work. Marks will be given according to the quality of your work and the demonstration. If you are asked to but you don’t demonstrate your work, no mark will be given to your assignment work.

3) Apart from demonstration of your work to the teaching staff members, it is mandatory for you to submit your program file to Faser (flowcharts are not to be submitted to Faser). You will not get mark for your work on the assignment if your program is not submitted to Faser. If your submission is late, there will penalty on your mark according to the university policy.

4) Extra check of your submitted program may be conducted by Professor He. If any programming or plagiarism problems are found from the check, your marks will be deducted.

4. Plagiarism

You should work individually on this assignment. Anything you submit is assumed to be entirely your own work. The usual Essex policy on plagiarism applies: http://www.essex.ac.uk/plagiarism/.

Appendix A. Sample Python Program for Caesar Cipher

 import sys #------------------------------------------------------------------------------ ### Note: Allow the program to be run from the command line:

## You can simply use the default message and key given in the program # python caesar_cipher.py

## You can also use message and key given in command line in Terminal (not required), ## where, atestmessage is the message (no space!)

【复现】并_离网风光互补制氢合成氨系统容量-调度优化分析(Python代码实现)内容概要:本文围绕“并_离网风光互补制氢合成氨系统容量-调度优化分析”的主题,提供了基于Python代码实现的技术研究与复现方法。通过构建风能、太阳能互补的可再生能源系统模型,结合电解水制氢与合成氨工艺流程,对系统的容量配置与运行调度进行联合优化分析。利用优化算法求解系统在不同运行模式下的最优容量配比和调度策略,兼顾经济性、能效性和稳定性,适用于并网与离网两种场景。文中强调通过代码实践完成系统建模、约束设定、目标函数设计及求解过程,帮助读者掌握综合能源系统优化的核心方法。; 适合人群:具备一定Python编程基础和能源系统背景的研究生、科研人员及工程技术人员,尤其适合从事可再生能源、氢能、综合能源系统优化等相关领域的从业者;; 使用场景及目标:①用于教学与科研中对风光制氢合成氨系统的建模与优化训练;②支撑实际项目中对多能互补系统容量规划与调度策略的设计与验证;③帮助理解优化算法在能源系统中的应用逻辑与实现路径;; 阅读建议:建议读者结合文中提供的Python代码进行逐模块调试与运行,配合文档说明深入理解模型构建细节,重点关注目标函数设计、约束条件设置及求解器调用方式,同时可对比Matlab版本实现以拓宽工具应用视野。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值