Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Profile Activity Vote Summary All Communities

Activity for Holden‭

Show all events Posts 3 Comments 1 Edits

Type	On...	Excerpt	Status	Date
Comment	Post #292206	I see, the second scheme is more inefficient because one more block has to be encrypted/decrypted. (more)	—	3 months ago
Edit	Post #292205	Initial revision	—	3 months ago
Question	—	Is this AES/CBC scheme, where the IV does not need to be known during decryption, insecure or does it have any other disadvantages? Usually a random IV is used for encryption with AES in CBC mode, so that key/IV pairs are not reused, which would be a vulnerability. During decryption, the IV of the encryption is required. If decryption is performed with a different IV, this leads to corruption of the first block in CBC mode. ... (more)	—	3 months ago
Edit	Post #286081	Initial revision	—	over 2 years ago
Answer	—	A: How can the Caesar cipher be implemented in Java? The formulas for encryption and decryption require a positive value of the modulo operation. However, this is not guaranteed for all implementations of the modulo operator. For instance, in Python the modulo value is always positive (e.g. `-2 % 5 = 3`), while in Java it can be negative (e.g. `-2 % 5 ... (more)	—	over 2 years ago
Edit	Post #286080	Initial revision	—	over 2 years ago
Question	—	How can the Caesar cipher be implemented in Java? The Caesar cipher is a substitution cipher in which the letters of an ordered alphabet are cyclically shifted by a given number. A detailed description can be found e.g. here. Let `u` be the index of the letter to be encrypted in the alphabet, `shift` the shift and `size` the number of letters of... (more)	—	over 2 years ago