A novel advance in data security is discussed in the International Journal of Information and Computer Security in which the Japanese puzzle known as Sudoku promises a cryptographic system for text information that works even in situations where computational power is limited. The approach could have applications in devices with constrained computer resources such as radio-frequency identification devices (RFID), medical and health care instruments, remote sensing networks, and smart cards.
The approach could be relevant for applications in devices with constrained computer resources such as radio-frequency identification devices (RFID), medical and health care instruments, remote sensing networks, and smart cards.
making room for all conceivable characters within a language, and even accommodating multiple languages
reads like snakeoil… Why not design the algorithm to work on arbitrary blocks of bytes so you don’t need to care about „characters“, just like any real-world encryption algorithm?
Yeah, no idea why. Seems like a basic character substitution algorithm using a basic one time pad scheme.
I’m not super deep into cryptography, because it’s a whole field unto itself with experts that can make your head spin in seconds. But this “novel” approach (given the description in this article which might be flawed), reads as neither novel nor secure.
I can’t access the DOI linked though, so I guess I’ll wait for more reliable coverage.
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !technology@beehaw.org
A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.
Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.
reads like snakeoil… Why not design the algorithm to work on arbitrary blocks of bytes so you don’t need to care about „characters“, just like any real-world encryption algorithm?
Yeah, no idea why. Seems like a basic character substitution algorithm using a basic one time pad scheme.
I’m not super deep into cryptography, because it’s a whole field unto itself with experts that can make your head spin in seconds. But this “novel” approach (given the description in this article which might be flawed), reads as neither novel nor secure.
I can’t access the DOI linked though, so I guess I’ll wait for more reliable coverage.