Source: http://www.google.com/patents/US8042025?dq=5,341,457
Timestamp: 2015-05-23 04:53:18
Document Index: 77146054

Matched Legal Cases: ['Application No. 200610172839', 'Application No. 200610172839', 'Application No. 200610172839', 'Application No. 200610172839', 'Application No. 200610172839', 'Application No. 096122784']

Patent US8042025 - Determining a message residue - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsIn one aspect, circuitry to determine a modular remainder with respect to a polynomial of a message comprised of a series of segment. In another aspect, circuitry to access at least a portion of a first number having a first endian format, determine a second number based on a bit reflection and shift...http://www.google.com/patents/US8042025?utm_source=gb-gplus-sharePatent US8042025 - Determining a message residueAdvanced Patent SearchPublication numberUS8042025 B2Publication typeGrantApplication numberUS 12/291,621Publication dateOct 18, 2011Filing dateNov 12, 2008Priority dateDec 18, 2007Fee statusPaidAlso published asUS20090158132, WO2009082598A1Publication number12291621, 291621, US 8042025 B2, US 8042025B2, US-B2-8042025, US8042025 B2, US8042025B2InventorsVinodh Gopal, Gilbert Wolrich, Wajdi Feghali, Erdinc Ozturk, Shay GueronOriginal AssigneeIntel CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (65), Non-Patent Citations (45), Classifications (7), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetDetermining a message residue
US 8042025 B2Abstract
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3980874May 9, 1975Sep 14, 1976Burroughs CorporationBinary to modulo M translationUS4945537 *Jun 3, 1988Jul 31, 1990Clarion Co., Ltd.Maximum length linearly occurring code sequence generatorUS4949294Oct 28, 1988Aug 14, 1990Thomson-CsfComputation circuit using residual arithmeticUS5166978Feb 21, 1991Nov 24, 1992U.S. Philips Corp.Encoding system according to the so-called rsa method, by means of a microcontroller and arrangement implementing this systemUS5274707Dec 6, 1991Dec 28, 1993Roger SchlaflyModular exponentiation and reduction device and methodUS5363107 *Jul 16, 1993Nov 8, 1994Massachusetts Institute Of TechnologyStorage and transmission of compressed weather maps and the likeUS5384786 *Apr 2, 1991Jan 24, 1995Cirrus Logic, Inc.Fast and efficient circuit for identifying errors introduced in Reed-Solomon codewordsUS5642367 *Feb 7, 1994Jun 24, 1997Mitsubishi Semiconductor America, Inc.Finite field polynomial processing module for error control codingUS5920702 *Apr 24, 1997Jul 6, 1999Sarnoff CorporationMethod of striping a data stream onto subsets of storage devices in a multiple user data distribution systemUS5942005 *Apr 8, 1997Aug 24, 1999International Business Machines CorporationMethod and means for computationally efficient error and erasure correction in linear cyclic codesUS6128766 *Nov 12, 1996Oct 3, 2000Pmc-Sierra Ltd.High speed cyclic redundancy check algorithmUS6185596Apr 1, 1998Feb 6, 2001Fortress U&T Ltd.Apparatus & method for modular multiplication & exponentiation based on Montgomery multiplicationUS6223320Feb 10, 1998Apr 24, 2001International Business Machines CorporationEfficient CRC generation utilizing parallel table lookup operationsUS6396926Mar 26, 1999May 28, 2002Nippon Telegraph & Telephone CorporationScheme for fast realization of encrytion, decryption and authenticationUS6484192Jan 28, 1999Nov 19, 2002Toyo Communication Equipment Co., Ltd.Root finding method and root finding circuit of quadratic polynomial over finite fieldUS6530057 *May 27, 1999Mar 4, 20033Com CorporationHigh speed generation and checking of cyclic redundancy check valuesUS6609410Sep 26, 2001Aug 26, 2003Spalding Sports Worldwide, Inc.High strain rate tester for materials used in sports ballsUS6666381Mar 16, 2001Dec 23, 2003Hitachi, Ltd.Information processing device, information processing method and smartcardUS6721771Aug 28, 2000Apr 13, 2004Sun Microsystems, Inc.Method for efficient modular polynomial division in finite fields f(2{circumflex over ( )}m)US6728052 *Jun 26, 2001Apr 27, 2004Hitachi, Ltd.Recording/reproducing apparatus, error correcting coding method and information recording methodUS6732317Oct 23, 2000May 4, 2004Sun Microsystems, Inc.Apparatus and method for applying multiple CRC generators to CRC calculationUS6795946May 5, 2000Sep 21, 20043Com CorporationFast frame error checker for multiple byte digital data framesUS6904558Feb 22, 2002Jun 7, 2005Agilent Technologies, Inc.Methods for computing the CRC of a message from the incremental CRCs of composite sub-messagesUS7027597Sep 18, 2001Apr 11, 2006Cisco Technologies, Inc.Pre-computation and dual-pass modular arithmetic operation approach to implement encryption protocols efficiently in electronic integrated circuitsUS7027598Sep 19, 2001Apr 11, 2006Cisco Technology, Inc.Residue number system based pre-computation and dual-pass arithmetic modular operation approach to implement encryption protocols efficiently in electronic integrated circuitsUS7058787May 5, 2003Jun 6, 2006Stmicroelectronics S.R.L.Method and circuit for generating memory addresses for a memory bufferUS7171604 *Dec 30, 2003Jan 30, 2007Intel CorporationMethod and apparatus for calculating cyclic redundancy check (CRC) on data using a programmable CRC engineUS7187770Jul 16, 2002Mar 6, 2007Cisco Technology, Inc.Method and apparatus for accelerating preliminary operations for cryptographic processingUS7190681 *Jun 9, 2003Mar 13, 2007Wu William WError coding in asynchronous transfer mode, internet and satellitesUS7243289Jan 25, 2003Jul 10, 2007Novell, Inc.Method and system for efficiently computing cyclic redundancy checksUS7343541 *Jan 14, 2004Mar 11, 2008Broadcom CorporationData integrity in protocol offloadingUS7428693Oct 20, 2004Sep 23, 2008Fujitsu LimitedError-detecting encoding and decoding apparatus and dividing apparatusUS7458006Sep 22, 2003Nov 25, 2008Avago Technologies General Ip (Singapore) Pte. Ltd.Methods for computing the CRC of a message from the incremental CRCs of composite sub-messagesUS7461115Mar 11, 2003Dec 2, 2008Sun Microsystems, Inc.Modular multiplierUS7543214Feb 11, 2005Jun 2, 2009Marvell International Ltd.Method and system for performing CRCUS20020053232Sep 26, 2001May 9, 2002Axe John D.High strain rate tester for materials used in sports ballsUS20020126838Jan 22, 2002Sep 12, 2002Atsushi ShimboModular exponentiation calculation apparatus and modular exponentiation calculation methodUS20020144208Feb 27, 2002Oct 3, 2002International Business Machines CorporationSystems and methods for enabling computation of CRC' s N-bit at a timeUS20030167440Feb 22, 2002Sep 4, 2003Cavanna Vicente V.Methods for computing the CRC of a message from the incremental CRCs of composite sub-messagesUS20030202657Apr 30, 2002Oct 30, 2003She Alfred C.Method and apparatus of fast modular reductionUS20030212729Mar 11, 2003Nov 13, 2003Sun Microsystems, Inc.Modular multiplierUS20040083251May 25, 2001Apr 29, 2004Geiringer Felix EgmontParallel modulo arithmetic using bitwise logical operationsUS20050044134Jul 23, 2003Feb 24, 2005Krueger Jon H.High-performance hashing systemUS20050138368Dec 19, 2003Jun 23, 2005Sydir Jaroslaw J.Method and apparatus for performing an authentication after cipher operation in a network processorUS20050149725Dec 30, 2003Jul 7, 2005Intel CorporationMethod and apparatus for aligning ciphered dataUS20050149744Dec 29, 2003Jul 7, 2005Intel CorporationNetwork processor having cryptographic processing including an authentication bufferUS20050149812Nov 19, 2004Jul 7, 2005Honeywell International Inc.Message error verification using checking with hidden dataUS20050154960 *Dec 30, 2003Jul 14, 2005Sydir Jaroslaw J.Method and apparatus for calculating CRC on data using a programmable CRC engineUS20060059219Sep 16, 2004Mar 16, 2006Koshy Kamal JMethod and apparatus for performing modular exponentiationsUS20060282743May 24, 2005Dec 14, 2006Michael KounavisInstructions for performing modulo-2 multiplication and bit reflectionUS20060282744May 25, 2005Dec 14, 2006Michael KounavisTechnique for performing cyclic redundancy code error detectionUS20070083585Oct 7, 2005Apr 12, 2007Elliptic Semiconductor Inc.Karatsuba based multiplier and methodUS20070150795Dec 23, 2005Jun 28, 2007King Steven RPerforming a cyclic redundancy checksum operation responsive to a user-level instructionUS20070157030Dec 30, 2005Jul 5, 2007Feghali Wajdi KCryptographic system componentUS20070297601Jun 27, 2006Dec 27, 2007Hasenplaugh William CModular reduction using foldingUS20080092020Oct 12, 2006Apr 17, 2008Hasenplaugh William CDetermining message residue using a set of polynomialsUS20080144811Dec 14, 2006Jun 19, 2008Intel CorporationMethod for Simultaneous Modular ExponentiationsUS20090019342Jul 13, 2007Jan 15, 2009Shay GueronDetermining a Message ResidueUS20090157784Dec 18, 2007Jun 18, 2009Vinodh GopalDetermining a message residueUS20090164546Dec 21, 2007Jun 25, 2009Vinodh GopalMethod and apparatus for efficient programmable cyclic redundancy check (crc)US20090168999Dec 28, 2007Jul 2, 2009Brent BoswellMethod and apparatus for performing cryptographic operationsWO2008002828A2Jun 21, 2007Jan 3, 2008Gunnar GaubatzModular reduction using foldingWO2009012050A2Jun 30, 2008Jan 22, 2009Intel CorpDetermining a message residueWO2009082598A1Dec 2, 2008Jul 2, 2009Vinodh GopalDetermining a message residueWO2009085489A2Nov 24, 2008Jul 9, 2009Wajdi FeghaliMethod and apparatus for efficient programmable cyclic redundancy check (crc)* Cited by examinerNon-Patent CitationsReference1"Number Theory and Public Key Cryptography," Introduction to Number Theory, Apr. 1996, pp. 1-12.2Barrett, "Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor," Proceedings on Advances in cryptology-CRYPTO '86,Copyright (c) 1998, Springer-Verlag, Berlin 1987, pp. 311-323.3Bosselaers et al., "Comparsion of three modular reduction function," Comparative Description and Evaluation, Katholieke Universiteit Leuven, Department of Electrical Engineering-ESAT Kardinaal Mercierlaan, Oct. 25, 1993, pp. 1-12.4Campobello et al., "Parallel CRF Realization," IEEE Transactions on Computers, vol. 52, No. 10, Oct. 2003, Published by the IEEE Computer Society, pp. 1312-1319.5Chin-Bou et al., "Design and Implementation of Long-Digit Karatsuba's Multiplication Alogorithm Using Tensor Product Formulation," Workshop on Compiler Techniques for High Performance Computing, 2003, pp. 1-8.6Dhem, "Design of an Efficient Public-Key Cryptographic Library for RISC-Based Smart Cards," Faculte Des Sciences appliquees Laboratoire de Microelectronique, Louvain-la-Neuve, Belgium, May 1998, 198 pages.7Federal Information Processing Standards Publication 197, Announcing the Advanced Encryption Standard (AES), Nov. 26, 2001, 51 pages.8Fischer et al., "Duality Between Multiplication and Modular Reduction," Infineon Technologies AG, Secure Mobile Solutions, Munich, Germany, Intel Corporation, Systems Technology Laboratory, Hillsboro, OR, Mar. 2005, pp. 1-13.9Gordon, "A survey of fast exponentiation methods," Center for Communications Research, Dec. 30, 1997, pp. 1-22.10International Preliminary Report on on Patentability received for PCT Patent Application No. PCT/US2007/071829, mailed on Jan. 15, 2009, 7 pages.11International Preliminary Report on Patentability for PCT Patent Application No. PCT/US2008/085284, mailed on Jul. 1, 2010, 6 pages.12International Preliminary Report on Patentability received for PCT Application No. PCT/US2008/084571 mailed on Jul. 1, 2010, 6 pages.13International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2008/068801, mailed on Jan. 28, 2010, 6 pages.14International Search Report & Written Opinion received for PCT Application No. PCT/US2007/071829, received on Dec. 12, 2007, 10 Pages.15International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/068801, mailed on Dec. 31, 2008, 10 pages.16International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/084571, mailed Jun. 18, 2009, 11 pages.17International Search Report/Written Opinion for PCT Patent Application No. PCT/US2008/085284, mailed on May 18, 2009, pp. 11.18Koc et al., "Analyzing and Comparing Montgomery Multiplication Algorithms," IEEE Micro, vol. 16, No. 3, 26-33, Jun. 1996, pp. 1-18.19Koopman et al., "Cyclic Redundancy Code (CRC) Polynomial Selection for Embedded Networks," The International Conference on Dependable Systems and Networks, DSN-2004, pp. 1-10.20Kounavis et al., "A Systematic Approach to Building High Performance Software-based CRC Generators," Proceedings of the 10th IEEE Symposium on Computers and Communications, ISCC 2005, pp. 855-862.21Lin et al., "High-Speed CRC Design for 10 Gbps applications," ISCAS 2006, IEEE, pp. 3177-3180.22Montgomery, "Five, Six, and Seven-Term Karatsuba-Like Formulae," IEEE Transactions on Computers, vol. 54, No. 3, Mar. 2005, 8 pages.23Montgomery, "Modular Multiplication Without Trial Division," Mathematics of 'Computation, vol. 44, No. 170, Apr. 1985, pp. 519-521.24Nedjah et al., "A reconfigurable recursive and efficient hardware for Karatsuba-Ofman's multiplication algorithm", Proceedings of 2003 IEEE Conference on Control Applications, vol. 2, Jun. 23-25, 2003, pp. 1076-1081.25Nedjah et al., "A Review of Modular Multiplication Methods and Respective Hardware Implementation," Informatica, vol. 30, No. 1, 2006, pp. 111-129.26Office Action Received for Chinese Patent Application No. 200610172839.9, mailed on Apr. 15, 2010, 4 Pages of Chinese Office Action and 5 Pages of English Translation.27Office Action Received for Chinese Patent Application No. 200610172839.9, mailed on Feb. 6, 2009, 3 Pages of Chinese Office Action and 5 Pages of English Translation.28Office Action Received for Chinese Patent Application No. 200610172839.9, mailed on Jan. 8, 2010, 3 Pages of Chinese Office Action and 5 Pages of English Translation.29Office Action Received for Chinese Patent Application No. 200610172839.9, mailed on Jul. 30, 2010, 5 Pages of English Translation.30Office Action Received for Chinese Patent Application No. 200610172839.9, mailed on Sep. 18, 2009, 4 Pages of Chinese Office Action and 5 Pages of English Translation.31Office Action Received for Taiwan Patent Application No. 096122784, mailed on Oct. 18, 2010, 10 Pages of Taiwan Office Action including 4 Pages of English Translation.32Office Action Received for U.S. Appl. No. 11/476,432, mailed on May 26, 2010, 13 pages.33Office Action Received for U.S. Appl. No. 11/476,432, mailed on Oct. 28, 2009, 24 pages.34Office Action received for U.S. Appl. No. 11/610,919, mailed on Jul. 8, 2010, 7 pages.35Office Action received for U.S. Appl. No. 11/777,538, mailed on Jan. 8, 2010, 9 pages.36Office Action received for U.S. Appl. No. 11/777,538, mailed on Jul. 9, 2010, 6 pages.37Office Action received for U.S. Appl. No. 11/959,142, mailed on Jun. 30, 2010, 11 pages.38Park et al., "Analysis of the Variable Length Nonzero Window Method for Exponentiation," 1999 Elsevier Science, Computers & Mathematics with Applications, vol. 37, Issue 7, Apr. 1999, pp. 21-29.39Phatak et al., "Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution," Proceedings of the 17th IEEE Symposium on Computer Arithmetic, 2005, pp. 179-186.40Ramabadran et al., "A Tutorial on CRC Computations," Micro, IEEE, IEEE Computer Society, Aug. 1988, pp. 62-75.41Sedlak, "The RSA Cryptography Processor," Lecture Notes in Computer Science, Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques, EUROCRYPT'87, 1987, Springer-Verlag Berlin, Heidelberg, pp. 95-105.42Sprachmann, "Automatic Generation of Parallel Circuits," IEEE Design and Test of Computers, May-Jun. 2001, pp. 108-114.43Tenca et al., "A Scalable Architecture for Montgomery Multiplication," Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science, No. 1717, Springer-Verlag London, UK, 1999, pp. 94-108.44Weimerskirch et al., "Generalizations of the Karatsuba Algorithm for Polynomial Multiplication," communication Security Group, Department of Electrical Engineering & Information Sciences, Bochum, Germany, Mar. 2002, pp. 1-23.45Williams, "A Painless Guide to CRC Error Detection Algorithms," Version 3, Aug. 19, 2003, Copyright 1993, 37 pages.Classifications U.S. Classification714/781, 714/751International ClassificationH03M13/03Cooperative ClassificationH03M13/091, G06F7/724European ClassificationG06F7/72F, H03M13/09BLegal EventsDateCodeEventDescriptionApr 1, 2015FPAYFee paymentYear of fee payment: 4May 15, 2009ASAssignmentOwner name: INTEL CORPORATION, CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOPAL, VINODH;WOLRICH, GILBERT;FEGHALI, WAJDI;AND OTHERS;REEL/FRAME:022690/0106;SIGNING DATES FROM 20081028 TO 20081108Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOPAL, VINODH;WOLRICH, GILBERT;FEGHALI, WAJDI;AND OTHERS;SIGNING DATES FROM 20081028 TO 20081108;REEL/FRAME:022690/0106Owner name: INTEL CORPORATION, CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOPAL, VINODH;WOLRICH, GILBERT;FEGHALI, WAJDI;AND OTHERS;SIGNING DATES FROM 20081028 TO 20081108;REEL/FRAME:022690/0106RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services