Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

FPGA implementation of humming bird cryptographic algorithm

Status
Not open for further replies.
G

gouri arnav

Newbie level 1
Joined
Jan 29, 2013
Messages
1
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,286
There is a permutation step [x xor (x<<6) xor (x<<10)] in the encryption process of hummingbird algorithm.I am not able to reverse this step.how to decrypt this?
[<< : left circular shift operator]
 

Some might argue that certain steps in crypto are hard to reverse on purpose. This might be one of those cases.

Case in point, without extra boundary conditions (i.e extra knowledge about the system) x xor (x<<6) xor (x<<10) might well be irreversible.

Edit: Did a quick check. I stand corrected by myself. It has an inverse. :p
 
Last edited:

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top