摘要:
Montgomery multiplication can be computed quickly by using carry save adders and parallel multipliers. We present an enhanced technique for very fast Montgomery multiplication that can be used for RSA calculations. This invention utilizes a scalable bit word implementation, suitable for very large bit encryptions. Such designs can be deployed on mid-level FPGAs that have dedicated multiplier logic, on ASICs, or on custom circuits. To our knowledge, our technique yields some of the fastest RSA encryption times to be reported, having area requirements similar to related work. Such circuits can be ideal for increased security in sensitive communication fields.
摘要:
For offering entertainment services by video streaming content to users, a video encoder creates the required .nsc file for each broadcast channel. This .nsc file is retrieved and stored on a server which notifies each set-top box in the field, via a multicast notifier of the availability of the new service. This notifier contains the multicast address and port to where the .nsc files are being streamed. Once the set-top box retrieves this notification, it attempts to join the dedicated multicast stream, download the .nsc files and store them locally in memory on the set-top box. When a user selects a broadcast channel from their lineup, the set-top box will access the local file to obtain the proper information about that particular ASF stream; hence, it will not have to do an HTTP retrieval.