首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Complexity of computation in finite fields
Authors:S B Gashkov  I S Sergeev
Institution:1. Moscow State University, 119899, Moscow, Russia
Abstract:We give a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号