1N/A/*
1N/A * Common Public License Version 0.5
1N/A *
1N/A * THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF
1N/A * THIS COMMON PUBLIC LICENSE ("AGREEMENT"). ANY USE,
1N/A * REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
1N/A * RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
1N/A *
1N/A * 1. DEFINITIONS
1N/A *
1N/A * "Contribution" means:
1N/A * a) in the case of the initial Contributor, the
1N/A * initial code and documentation distributed under
1N/A * this Agreement, and
1N/A *
1N/A * b) in the case of each subsequent Contributor:
1N/A * i) changes to the Program, and
1N/A * ii) additions to the Program;
1N/A *
1N/A * where such changes and/or additions to the Program
1N/A * originate from and are distributed by that
1N/A * particular Contributor. A Contribution 'originates'
1N/A * from a Contributor if it was added to the Program
1N/A * by such Contributor itself or anyone acting on such
1N/A * Contributor's behalf. Contributions do not include
1N/A * additions to the Program which: (i) are separate
1N/A * modules of software distributed in conjunction with
1N/A * the Program under their own license agreement, and
1N/A * (ii) are not derivative works of the Program.
1N/A *
1N/A *
1N/A * "Contributor" means any person or entity that distributes
1N/A * the Program.
1N/A *
1N/A * "Licensed Patents " mean patent claims licensable by a
1N/A * Contributor which are necessarily infringed by the use or
1N/A * sale of its Contribution alone or when combined with the
1N/A * Program.
1N/A *
1N/A * "Program" means the Contributions distributed in
1N/A * accordance with this Agreement.
1N/A *
1N/A * "Recipient" means anyone who receives the Program under
1N/A * this Agreement, including all Contributors.
1N/A *
1N/A * 2. GRANT OF RIGHTS
1N/A *
1N/A * a) Subject to the terms of this Agreement, each
1N/A * Contributor hereby grants Recipient a
1N/A * no - exclusive, worldwide, royalt - free copyright
1N/A * license to reproduce, prepare derivative works of,
1N/A * publicly display, publicly perform, distribute and
1N/A * sublicense the Contribution of such Contributor, if
1N/A * any, and such derivative works, in source code and
1N/A * object code form.
1N/A *
1N/A * b) Subject to the terms of this Agreement, each
1N/A * Contributor hereby grants Recipient a
1N/A * no - exclusive, worldwide, royalt - free patent
1N/A * license under Licensed Patents to make, use, sell,
1N/A * offer to sell, import and otherwise transfer the
1N/A * Contribution of such Contributor, if any, in source
1N/A * code and object code form. This patent license
1N/A * shall apply to the combination of the Contribution
1N/A * and the Program if, at the time the Contribution is
1N/A * added by the Contributor, such addition of the
1N/A * Contribution causes such combination to be covered
1N/A * by the Licensed Patents. The patent license shall
1N/A * not apply to any other combinations which include
1N/A * the Contribution. No hardware per se is licensed
1N/A * hereunder.
1N/A *
1N/A * c) Recipient understands that although each
1N/A * Contributor grants the licenses to its
1N/A * Contributions set forth herein, no assurances are
1N/A * provided by any Contributor that the Program does
1N/A * not infringe the patent or other intellectual
1N/A * property rights of any other entity. Each
1N/A * Contributor disclaims any liability to Recipient
1N/A * for claims brought by any other entity based on
1N/A * infringement of intellectual property rights or
1N/A * otherwise. As a condition to exercising the rights
1N/A * and licenses granted hereunder, each Recipient
1N/A * hereby assumes sole responsibility to secure any
1N/A * other intellectual property rights needed, if any.
1N/A *
1N/A * For example, if a third party patent license is
1N/A * required to allow Recipient to distribute the
1N/A * Program, it is Recipient's responsibility to
1N/A * acquire that license before distributing the
1N/A * Program.
1N/A *
1N/A * d) Each Contributor represents that to its
1N/A * knowledge it has sufficient copyright rights in its
1N/A * Contribution, if any, to grant the copyright
1N/A * license set forth in this Agreement.
1N/A *
1N/A * 3. REQUIREMENTS
1N/A *
1N/A * A Contributor may choose to distribute the Program in
1N/A * object code form under its own license agreement, provided
1N/A * that:
1N/A * a) it complies with the terms and conditions of
1N/A * this Agreement; and
1N/A *
1N/A * b) its license agreement:
1N/A * i) effectively disclaims on behalf of all
1N/A * Contributors all warranties and conditions, express
1N/A * and implied, including warranties or conditions of
1N/A * title and no - infringement, and implied warranties
1N/A * or conditions of merchantability and fitness for a
1N/A * particular purpose;
1N/A *
1N/A * ii) effectively excludes on behalf of all
1N/A * Contributors all liability for damages, including
1N/A * direct, indirect, special, incidental and
1N/A * consequential damages, such as lost profits;
1N/A *
1N/A * iii) states that any provisions which differ from
1N/A * this Agreement are offered by that Contributor
1N/A * alone and not by any other party; and
1N/A *
1N/A * iv) states that source code for the Program is
1N/A * available from such Contributor, and informs
1N/A * licensees how to obtain it in a reasonable manner
1N/A * on or through a medium customarily used for
1N/A * software exchange.
1N/A *
1N/A * When the Program is made available in source code form:
1N/A * a) it must be made available under this Agreement;
1N/A * and
1N/A * b) a copy of this Agreement must be included with
1N/A * each copy of the Program.
1N/A *
1N/A * Contributors may not remove or alter any copyright notices
1N/A * contained within the Program.
1N/A *
1N/A * Each Contributor must identify itself as the originator of
1N/A * its Contribution, if any, in a manner that reasonably
1N/A * allows subsequent Recipients to identify the originator of
1N/A * the Contribution.
1N/A *
1N/A *
1N/A * 4. COMMERCIAL DISTRIBUTION
1N/A *
1N/A * Commercial distributors of software may accept certain
1N/A * responsibilities with respect to end users, business
1N/A * partners and the like. While this license is intended to
1N/A * facilitate the commercial use of the Program, the
1N/A * Contributor who includes the Program in a commercial
1N/A * product offering should do so in a manner which does not
1N/A * create potential liability for other Contributors.
1N/A * Therefore, if a Contributor includes the Program in a
1N/A * commercial product offering, such Contributor ("Commercial
1N/A * Contributor") hereby agrees to defend and indemnify every
1N/A * other Contributor ("Indemnified Contributor") against any
1N/A * losses, damages and costs (collectively "Losses") arising
1N/A * from claims, lawsuits and other legal actions brought by a
1N/A * third party against the Indemnified Contributor to the
1N/A * extent caused by the acts or omissions of such Commercial
1N/A * Contributor in connection with its distribution of the
1N/A * Program in a commercial product offering. The obligations
1N/A * in this section do not apply to any claims or Losses
1N/A * relating to any actual or alleged intellectual property
1N/A * infringement. In order to qualify, an Indemnified
1N/A * Contributor must: a) promptly notify the Commercial
1N/A * Contributor in writing of such claim, and b) allow the
1N/A * Commercial Contributor to control, and cooperate with the
1N/A * Commercial Contributor in, the defense and any related
1N/A * settlement negotiations. The Indemnified Contributor may
1N/A * participate in any such claim at its own expense.
1N/A *
1N/A *
1N/A * For example, a Contributor might include the Program in a
1N/A * commercial product offering, Product X. That Contributor
1N/A * is then a Commercial Contributor. If that Commercial
1N/A * Contributor then makes performance claims, or offers
1N/A * warranties related to Product X, those performance claims
1N/A * and warranties are such Commercial Contributor's
1N/A * responsibility alone. Under this section, the Commercial
1N/A * Contributor would have to defend claims against the other
1N/A * Contributors related to those performance claims and
1N/A * warranties, and if a court requires any other Contributor
1N/A * to pay any damages as a result, the Commercial Contributor
1N/A * must pay those damages.
1N/A *
1N/A *
1N/A * 5. NO WARRANTY
1N/A *
1N/A * EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE
1N/A * PROGRAM IS PROVIDED ON AN "AS IS" BASIS, WITHOUT
1N/A * WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR
1N/A * IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR
1N/A * CONDITIONS OF TITLE, NO - INFRINGEMENT, MERCHANTABILITY OR
1N/A * FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely
1N/A * responsible for determining the appropriateness of using
1N/A * and distributing the Program and assumes all risks
1N/A * associated with its exercise of rights under this
1N/A * Agreement, including but not limited to the risks and
1N/A * costs of program errors, compliance with applicable laws,
1N/A * damage to or loss of data, programs or equipment, and
1N/A * unavailability or interruption of operations.
1N/A *
1N/A * 6. DISCLAIMER OF LIABILITY
1N/A * EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER
1N/A * RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY
1N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
1N/A * OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION
1N/A * LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF
1N/A * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
1N/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
1N/A * OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE
1N/A * OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE
1N/A * POSSIBILITY OF SUCH DAMAGES.
1N/A *
1N/A * 7. GENERAL
1N/A *
1N/A * If any provision of this Agreement is invalid or
1N/A * unenforceable under applicable law, it shall not affect
1N/A * the validity or enforceability of the remainder of the
1N/A * terms of this Agreement, and without further action by the
1N/A * parties hereto, such provision shall be reformed to the
1N/A * minimum extent necessary to make such provision valid and
1N/A * enforceable.
1N/A *
1N/A *
1N/A * If Recipient institutes patent litigation against a
1N/A * Contributor with respect to a patent applicable to
1N/A * software (including a cros - claim or counterclaim in a
1N/A * lawsuit), then any patent licenses granted by that
1N/A * Contributor to such Recipient under this Agreement shall
1N/A * terminate as of the date such litigation is filed. In
1N/A * addition, If Recipient institutes patent litigation
1N/A * against any entity (including a cros - claim or
1N/A * counterclaim in a lawsuit) alleging that the Program
1N/A * itself (excluding combinations of the Program with other
1N/A * software or hardware) infringes such Recipient's
1N/A * patent(s), then such Recipient's rights granted under
1N/A * Section 2(b) shall terminate as of the date such
1N/A * litigation is filed.
1N/A *
1N/A * All Recipient's rights under this Agreement shall
1N/A * terminate if it fails to comply with any of the material
1N/A * terms or conditions of this Agreement and does not cure
1N/A * such failure in a reasonable period of time after becoming
1N/A * aware of such noncompliance. If all Recipient's rights
1N/A * under this Agreement terminate, Recipient agrees to cease
1N/A * use and distribution of the Program as soon as reasonably
1N/A * practicable. However, Recipient's obligations under this
1N/A * Agreement and any licenses granted by Recipient relating
1N/A * to the Program shall continue and survive.
1N/A *
1N/A * Everyone is permitted to copy and distribute copies of
1N/A * this Agreement, but in order to avoid inconsistency the
1N/A * Agreement is copyrighted and may only be modified in the
1N/A * following manner. The Agreement Steward reserves the right
1N/A * to publish new versions (including revisions) of this
1N/A * Agreement from time to time. No one other than the
1N/A * Agreement Steward has the right to modify this Agreement.
1N/A *
1N/A * IBM is the initial Agreement Steward. IBM may assign the
1N/A * responsibility to serve as the Agreement Steward to a
1N/A * suitable separate entity. Each new version of the
1N/A * Agreement will be given a distinguishing version number.
1N/A * The Program (including Contributions) may always be
1N/A * distributed subject to the version of the Agreement under
1N/A * which it was received. In addition, after a new version of
1N/A * the Agreement is published, Contributor may elect to
1N/A * distribute the Program (including its Contributions) under
1N/A * the new version. Except as expressly stated in Sections
1N/A * 2(a) and 2(b) above, Recipient receives no rights or
1N/A * licenses to the intellectual property of any Contributor
1N/A * under this Agreement, whether expressly, by implication,
1N/A * estoppel or otherwise. All rights in the Program not
1N/A * expressly granted under this Agreement are reserved.
1N/A *
1N/A *
1N/A * This Agreement is governed by the laws of the State of New
1N/A * York and the intellectual property laws of the United
1N/A * States of America. No party to this Agreement will bring a
1N/A * legal action under this Agreement more than one year after
1N/A * the cause of action arose. Each party waives its rights to
1N/A * a jury trial in any resulting litigation.
1N/A *
1N/A *
1N/A *
1N/A * (C) COPYRIGHT International Business Machines Corp. 2001, 2002
1N/A */
1N/A/*
1N/A * Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved.
1N/A */
1N/A#include "tpmtok_int.h"
1N/A
1N/ACK_ULONG
1N/Aber_encode_INTEGER(CK_BBOOL length_only,
1N/A CK_BYTE ** ber_int,
1N/A CK_ULONG * ber_int_len,
1N/A CK_BYTE * data,
1N/A CK_ULONG data_len)
1N/A{
1N/A CK_BYTE *buf = NULL;
1N/A CK_ULONG len;
1N/A
1N/A /*
1N/A * if data_len < 127 use short form length id
1N/A * if data_len < 256 use long form length id with
1N/A * byte length field
1N/A * if data_len < 65536 use long form length id with
1N/A * byte length field
1N/A * if data_len < 16777216 use long form length id
1N/A * with byte length field
1N/A */
1N/A if (data_len < 128)
1N/A len = 1 + 1 + data_len;
1N/A else if (data_len < 256)
1N/A len = 1 + (1 + 1) + data_len;
1N/A else if (data_len < (1 << 16))
1N/A len = 1 + (1 + 2) + data_len;
1N/A else if (data_len < (1 << 24))
1N/A len = 1 + (1 + 3) + data_len;
1N/A else
1N/A return (CKR_FUNCTION_FAILED);
1N/A
1N/A if (length_only == TRUE) {
1N/A *ber_int_len = len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A buf = (CK_BYTE *)malloc(len);
1N/A if (! buf) {
1N/A return (CKR_HOST_MEMORY);
1N/A }
1N/A if (data_len < 128) {
1N/A buf[0] = 0x02;
1N/A buf[1] = data_len;
1N/A (void) memcpy(&buf[2], data, data_len);
1N/A
1N/A *ber_int_len = len;
1N/A *ber_int = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < 256) {
1N/A buf[0] = 0x02;
1N/A buf[1] = 0x81;
1N/A buf[2] = data_len;
1N/A (void) memcpy(&buf[3], data, data_len);
1N/A
1N/A *ber_int_len = len;
1N/A *ber_int = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < (1 << 16)) {
1N/A buf[0] = 0x02;
1N/A buf[1] = 0x82;
1N/A buf[2] = (data_len >> 8) & 0xFF;
1N/A buf[3] = (data_len) & 0xFF;
1N/A (void) memcpy(&buf[4], data, data_len);
1N/A
1N/A *ber_int_len = len;
1N/A *ber_int = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < (1 << 24)) {
1N/A buf[0] = 0x02;
1N/A buf[1] = 0x83;
1N/A buf[2] = (data_len >> 16) & 0xFF;
1N/A buf[3] = (data_len >> 8) & 0xFF;
1N/A buf[4] = (data_len) & 0xFF;
1N/A (void) memcpy(&buf[5], data, data_len);
1N/A
1N/A *ber_int_len = len;
1N/A *ber_int = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A free(buf);
1N/A return (CKR_FUNCTION_FAILED);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_decode_INTEGER(CK_BYTE * ber_int,
1N/A CK_BYTE ** data,
1N/A CK_ULONG * data_len,
1N/A CK_ULONG * field_len)
1N/A{
1N/A CK_ULONG len, length_octets;
1N/A
1N/A if (! ber_int) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if (ber_int[0] != 0x02) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if ((ber_int[1] & 0x80) == 0) {
1N/A len = ber_int[1] & 0x7F;
1N/A
1N/A *data = &ber_int[2];
1N/A *data_len = len;
1N/A *field_len = 1 + 1 + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A length_octets = ber_int[1] & 0x7F;
1N/A
1N/A if (length_octets == 1) {
1N/A len = ber_int[2];
1N/A
1N/A *data = &ber_int[3];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 1) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 2) {
1N/A len = ber_int[2];
1N/A len = len << 8;
1N/A len |= ber_int[3];
1N/A
1N/A *data = &ber_int[4];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 2) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 3) {
1N/A len = ber_int[2];
1N/A len = len << 8;
1N/A len |= ber_int[3];
1N/A len = len << 8;
1N/A len |= ber_int[4];
1N/A
1N/A *data = &ber_int[5];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 3) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A return (CKR_FUNCTION_FAILED);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_encode_OCTET_STRING(CK_BBOOL length_only,
1N/ACK_BYTE ** str,
1N/ACK_ULONG * str_len,
1N/ACK_BYTE * data,
1N/ACK_ULONG data_len)
1N/A{
1N/A CK_BYTE *buf = NULL;
1N/A CK_ULONG len;
1N/A
1N/A
1N/A /*
1N/A * if data_len < 128 use shor - form length id
1N/A * if data_len < 256 use lon - form length id with - byte length field
1N/A * if data_len < 65536 use lon - form length id with - byte length field
1N/A */
1N/A if (data_len < 128)
1N/A len = 1 + 1 + data_len;
1N/A else if (data_len < 256)
1N/A len = 1 + (1 + 1) + data_len;
1N/A else if (data_len < (1 << 16))
1N/A len = 1 + (1 + 2) + data_len;
1N/A else if (data_len < (1 << 24))
1N/A len = 1 + (1 + 3) + data_len;
1N/A else
1N/A return (CKR_FUNCTION_FAILED);
1N/A
1N/A if (length_only == TRUE) {
1N/A *str_len = len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A buf = (CK_BYTE *)malloc(len);
1N/A if (! buf) {
1N/A return (CKR_HOST_MEMORY);
1N/A }
1N/A
1N/A if (data_len < 128) {
1N/A buf[0] = 0x04; /* primitive, OCTET STRING */
1N/A buf[1] = data_len;
1N/A (void) memcpy(&buf[2], data, data_len);
1N/A
1N/A *str_len = len;
1N/A *str = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < 256) {
1N/A buf[0] = 0x04; /* primitive, OCTET STRING */
1N/A buf[1] = 0x81; /* length header -- 1 length octets */
1N/A buf[2] = data_len;
1N/A
1N/A (void) memcpy(&buf[3], data, data_len);
1N/A
1N/A *str_len = len;
1N/A *str = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < (1 << 16)) {
1N/A buf[0] = 0x04; /* primitive, OCTET STRING */
1N/A buf[1] = 0x82; /* length header -- 2 length octets */
1N/A buf[2] = (data_len >> 8) & 0xFF;
1N/A buf[3] = (data_len) & 0xFF;
1N/A
1N/A (void) memcpy(&buf[4], data, data_len);
1N/A
1N/A *str_len = len;
1N/A *str = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < (1 << 24)) {
1N/A buf[0] = 0x04; /* primitive, OCTET STRING */
1N/A buf[1] = 0x83; /* length header -- 3 length octets */
1N/A buf[2] = (data_len >> 16) & 0xFF;
1N/A buf[3] = (data_len >> 8) & 0xFF;
1N/A buf[4] = (data_len) & 0xFF;
1N/A
1N/A (void) memcpy(&buf[5], data, data_len);
1N/A
1N/A *str_len = len;
1N/A *str = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A free(buf);
1N/A return (CKR_FUNCTION_FAILED);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_decode_OCTET_STRING(CK_BYTE * str,
1N/A CK_BYTE ** data,
1N/A CK_ULONG * data_len,
1N/A CK_ULONG * field_len)
1N/A{
1N/A CK_ULONG len, length_octets;
1N/A
1N/A if (! str) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if (str[0] != 0x04) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if ((str[1] & 0x80) == 0) {
1N/A len = str[1] & 0x7F;
1N/A
1N/A *data = &str[2];
1N/A *data_len = len;
1N/A *field_len = 1 + (1) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A length_octets = str[1] & 0x7F;
1N/A
1N/A if (length_octets == 1) {
1N/A len = str[2];
1N/A
1N/A *data = &str[3];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 1) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 2) {
1N/A len = str[2];
1N/A len = len << 8;
1N/A len |= str[3];
1N/A
1N/A *data = &str[4];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 2) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 3) {
1N/A len = str[2];
1N/A len = len << 8;
1N/A len |= str[3];
1N/A len = len << 8;
1N/A len |= str[4];
1N/A
1N/A *data = &str[5];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 3) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A /* > 3 length octets implies a length > 16MB */
1N/A return (CKR_FUNCTION_FAILED);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_encode_SEQUENCE(CK_BBOOL length_only,
1N/A CK_BYTE ** seq,
1N/A CK_ULONG * seq_len,
1N/A CK_BYTE * data,
1N/A CK_ULONG data_len)
1N/A{
1N/A CK_BYTE *buf = NULL;
1N/A CK_ULONG len;
1N/A
1N/A if (data_len < 128)
1N/A len = 1 + 1 + data_len;
1N/A else if (data_len < 256)
1N/A len = 1 + (1 + 1) + data_len;
1N/A else if (data_len < (1 << 16))
1N/A len = 1 + (1 + 2) + data_len;
1N/A else if (data_len < (1 << 24))
1N/A len = 1 + (1 + 3) + data_len;
1N/A else
1N/A return (CKR_FUNCTION_FAILED);
1N/A
1N/A if (length_only == TRUE) {
1N/A *seq_len = len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A buf = (CK_BYTE *)malloc(len);
1N/A if (! buf) {
1N/A return (CKR_HOST_MEMORY);
1N/A }
1N/A
1N/A if (data_len < 128) {
1N/A buf[0] = 0x30; /* constructed, SEQUENCE */
1N/A buf[1] = data_len;
1N/A (void) memcpy(&buf[2], data, data_len);
1N/A
1N/A *seq_len = len;
1N/A *seq = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < 256) {
1N/A buf[0] = 0x30; /* constructed, SEQUENCE */
1N/A buf[1] = 0x81; /* length header -- 1 length octets */
1N/A buf[2] = data_len;
1N/A
1N/A (void) memcpy(&buf[3], data, data_len);
1N/A
1N/A *seq_len = len;
1N/A *seq = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (data_len < (1 << 16)) {
1N/A buf[0] = 0x30; /* constructed, SEQUENCE */
1N/A buf[1] = 0x82; /* length header -- 2 length octets */
1N/A buf[2] = (data_len >> 8) & 0xFF;
1N/A buf[3] = (data_len) & 0xFF;
1N/A
1N/A (void) memcpy(&buf[4], data, data_len);
1N/A
1N/A *seq_len = len;
1N/A *seq = buf;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A /* data_len MUST be < (1<<24) to get this far, no need to check. */
1N/A buf[0] = 0x30; /* constructed, SEQUENCE */
1N/A buf[1] = 0x83; /* length header -- 3 length octets */
1N/A buf[2] = (data_len >> 16) & 0xFF;
1N/A buf[3] = (data_len >> 8) & 0xFF;
1N/A buf[4] = (data_len) & 0xFF;
1N/A
1N/A (void) memcpy(&buf[5], data, data_len);
1N/A
1N/A *seq_len = len;
1N/A *seq = buf;
1N/A return (CKR_OK);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_decode_SEQUENCE(CK_BYTE * seq,
1N/A CK_BYTE ** data,
1N/A CK_ULONG * data_len,
1N/A CK_ULONG * field_len)
1N/A{
1N/A CK_ULONG len, length_octets;
1N/A
1N/A if (! seq) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if (seq[0] != 0x30) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if ((seq[1] & 0x80) == 0) {
1N/A len = seq[1] & 0x7F;
1N/A
1N/A *data = &seq[2];
1N/A *data_len = len;
1N/A *field_len = 1 + (1) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A length_octets = seq[1] & 0x7F;
1N/A
1N/A if (length_octets == 1) {
1N/A len = seq[2];
1N/A
1N/A *data = &seq[3];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 1) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 2) {
1N/A len = seq[2];
1N/A len = len << 8;
1N/A len |= seq[3];
1N/A
1N/A *data = &seq[4];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 2) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A if (length_octets == 3) {
1N/A len = seq[2];
1N/A len = len << 8;
1N/A len |= seq[3];
1N/A len = len << 8;
1N/A len |= seq[4];
1N/A
1N/A *data = &seq[5];
1N/A *data_len = len;
1N/A *field_len = 1 + (1 + 3) + len;
1N/A return (CKR_OK);
1N/A }
1N/A
1N/A return (CKR_FUNCTION_FAILED);
1N/A}
1N/A
1N/A/*
1N/A *
1N/A * PrivateKeyInfo ::= SEQUENCE {
1N/A * version Version -- always '0' for now
1N/A * privateKeyAlgorithm PrivateKeyAlgorithmIdentifier
1N/A * privateKey PrivateKey
1N/A * attributes
1N/A * }
1N/A */
1N/ACK_RV
1N/Aber_encode_PrivateKeyInfo(CK_BBOOL length_only,
1N/ACK_BYTE ** data,
1N/ACK_ULONG * data_len,
1N/ACK_BYTE * algorithm_id,
1N/ACK_ULONG algorithm_id_len,
1N/ACK_BYTE * priv_key,
1N/ACK_ULONG priv_key_len)
1N/A{
1N/A CK_BYTE * buf = NULL;
1N/A CK_BYTE * tmp = NULL;
1N/A CK_BYTE version[] = { 0 };
1N/A CK_BYTE attrib[] = { 0x05, 0x00 };
1N/A CK_ULONG len, total;
1N/A CK_RV rc;
1N/A
1N/A len = 0;
1N/A
1N/A rc = ber_encode_INTEGER(TRUE, NULL, &total, version, sizeof (version));
1N/A if (rc != CKR_OK) {
1N/A return (rc);
1N/A }
1N/A else
1N/A len += total;
1N/A
1N/A len += algorithm_id_len;
1N/A
1N/A rc = ber_encode_OCTET_STRING(TRUE, NULL, &total,
1N/A priv_key, priv_key_len);
1N/A
1N/A if (rc != CKR_OK)
1N/A return (rc);
1N/A
1N/A len += total;
1N/A
1N/A /* for this stuff, attributes are always NULL == 05 00 */
1N/A len += sizeof (attrib);
1N/A
1N/A if (length_only == TRUE) {
1N/A rc = ber_encode_SEQUENCE(TRUE, NULL, &total, NULL, len);
1N/A
1N/A if (rc == CKR_OK)
1N/A *data_len = total;
1N/A return (rc);
1N/A }
1N/A
1N/A buf = (CK_BYTE *)malloc(len);
1N/A if (! buf) {
1N/A return (CKR_HOST_MEMORY);
1N/A }
1N/A len = 0;
1N/A rc = ber_encode_INTEGER(FALSE, &tmp, &total, version, sizeof (version));
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + len, tmp, total);
1N/A len += total;
1N/A free(tmp);
1N/A
1N/A (void) memcpy(buf + len, algorithm_id, algorithm_id_len);
1N/A len += algorithm_id_len;
1N/A
1N/A rc = ber_encode_OCTET_STRING(FALSE, &tmp, &total,
1N/A priv_key, priv_key_len);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + len, tmp, total);
1N/A len += total;
1N/A free(tmp);
1N/A
1N/A (void) memcpy(buf + len, attrib, sizeof (attrib));
1N/A len += sizeof (attrib);
1N/A
1N/A rc = ber_encode_SEQUENCE(FALSE, data, data_len, buf, len);
1N/A
1N/Aerror:
1N/A free(buf);
1N/A return (rc);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_decode_PrivateKeyInfo(CK_BYTE * data,
1N/A CK_ULONG data_len,
1N/A CK_BYTE ** algorithm,
1N/A CK_ULONG * alg_len,
1N/A CK_BYTE ** priv_key)
1N/A{
1N/A CK_BYTE *buf = NULL;
1N/A CK_BYTE *alg = NULL;
1N/A CK_BYTE *ver = NULL;
1N/A CK_ULONG buf_len, offset, len, field_len;
1N/A CK_RV rc;
1N/A
1N/A if (! data || (data_len == 0)) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A rc = ber_decode_SEQUENCE(data, &buf, &buf_len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A return (rc);
1N/A }
1N/A offset = 0;
1N/A rc = ber_decode_INTEGER(buf + offset, &ver, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A return (rc);
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_SEQUENCE(buf + offset, &alg, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A return (rc);
1N/A }
1N/A *algorithm = alg;
1N/A *alg_len = len;
1N/A
1N/A rc = ber_decode_OCTET_STRING(alg + len, priv_key, &buf_len, &field_len);
1N/A return (rc);
1N/A}
1N/A
1N/A/*
1N/A * RSAPrivateKey ::= SEQUENCE {
1N/A * version Version -- always '0' for now
1N/A * modulus INTEGER
1N/A * publicExponent INTEGER
1N/A * privateExponent INTEGER
1N/A * prime1 INTEGER
1N/A * prime2 INTEGER
1N/A * exponent1 INTEGER
1N/A * exponent2 INTEGER
1N/A * coefficient INTEGER
1N/A * }
1N/A */
1N/ACK_RV
1N/Aber_encode_RSAPrivateKey(CK_BBOOL length_only,
1N/A CK_BYTE ** data,
1N/A CK_ULONG * data_len,
1N/A CK_ATTRIBUTE * modulus,
1N/A CK_ATTRIBUTE * publ_exp,
1N/A CK_ATTRIBUTE * priv_exp,
1N/A CK_ATTRIBUTE * prime1,
1N/A CK_ATTRIBUTE * prime2,
1N/A CK_ATTRIBUTE * exponent1,
1N/A CK_ATTRIBUTE * exponent2,
1N/A CK_ATTRIBUTE * coeff)
1N/A{
1N/A CK_BYTE *buf = NULL;
1N/A CK_BYTE *buf2 = NULL;
1N/A CK_ULONG len, offset;
1N/A CK_BYTE version[] = { 0 };
1N/A CK_RV rc;
1N/A
1N/A offset = 0;
1N/A rc = 0;
1N/A
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A sizeof (version));
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A modulus->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A publ_exp->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A priv_exp->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A prime1->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A prime2->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A exponent1->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A exponent2->ulValueLen);
1N/A offset += len;
1N/A rc |= ber_encode_INTEGER(TRUE, NULL, &len, NULL,
1N/A coeff->ulValueLen);
1N/A offset += len;
1N/A
1N/A if (rc != CKR_OK) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A if (length_only == TRUE) {
1N/A rc = ber_encode_SEQUENCE(TRUE, NULL, &len, NULL, offset);
1N/A if (rc != CKR_OK)
1N/A return (rc);
1N/A rc = ber_encode_PrivateKeyInfo(TRUE,
1N/A NULL, data_len,
1N/A NULL, ber_AlgIdRSAEncryptionLen,
1N/A NULL, len);
1N/A if (rc != CKR_OK)
1N/A return (rc);
1N/A return (rc);
1N/A }
1N/A
1N/A buf = (CK_BYTE *)malloc(offset);
1N/A if (! buf) {
1N/A return (CKR_HOST_MEMORY);
1N/A }
1N/A offset = 0;
1N/A rc = 0;
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len, version, sizeof (version));
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)modulus + sizeof (CK_ATTRIBUTE), modulus->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)publ_exp + sizeof (CK_ATTRIBUTE), publ_exp->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)priv_exp + sizeof (CK_ATTRIBUTE),
1N/A priv_exp->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)prime1 + sizeof (CK_ATTRIBUTE), prime1->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)prime2 + sizeof (CK_ATTRIBUTE), prime2->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)exponent1 + sizeof (CK_ATTRIBUTE),
1N/A exponent1->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)exponent2 + sizeof (CK_ATTRIBUTE),
1N/A exponent2->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_INTEGER(FALSE, &buf2, &len,
1N/A (CK_BYTE *)coeff + sizeof (CK_ATTRIBUTE), coeff->ulValueLen);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A (void) memcpy(buf + offset, buf2, len);
1N/A offset += len;
1N/A free(buf2);
1N/A
1N/A rc = ber_encode_SEQUENCE(FALSE, &buf2, &len, buf, offset);
1N/A if (rc != CKR_OK) {
1N/A goto error;
1N/A }
1N/A rc = ber_encode_PrivateKeyInfo(FALSE,
1N/A data, data_len,
1N/A ber_AlgIdRSAEncryption, ber_AlgIdRSAEncryptionLen,
1N/A buf2, len);
1N/Aerror:
1N/A if (buf2) free(buf2);
1N/A if (buf) free(buf);
1N/A return (rc);
1N/A}
1N/A
1N/ACK_RV
1N/Aber_decode_RSAPrivateKey(CK_BYTE * data,
1N/A CK_ULONG data_len,
1N/A CK_ATTRIBUTE ** modulus,
1N/A CK_ATTRIBUTE ** publ_exp,
1N/A CK_ATTRIBUTE ** priv_exp,
1N/A CK_ATTRIBUTE ** prime1,
1N/A CK_ATTRIBUTE ** prime2,
1N/A CK_ATTRIBUTE ** exponent1,
1N/A CK_ATTRIBUTE ** exponent2,
1N/A CK_ATTRIBUTE ** coeff)
1N/A{
1N/A CK_ATTRIBUTE *n_attr = NULL;
1N/A CK_ATTRIBUTE *e_attr = NULL;
1N/A CK_ATTRIBUTE *d_attr = NULL;
1N/A CK_ATTRIBUTE *p_attr = NULL;
1N/A CK_ATTRIBUTE *q_attr = NULL;
1N/A CK_ATTRIBUTE *e1_attr = NULL;
1N/A CK_ATTRIBUTE *e2_attr = NULL;
1N/A CK_ATTRIBUTE *coeff_attr = NULL;
1N/A
1N/A CK_BYTE *alg = NULL;
1N/A CK_BYTE *rsa_priv_key = NULL;
1N/A CK_BYTE *buf = NULL;
1N/A CK_BYTE *tmp = NULL;
1N/A CK_ULONG offset, buf_len, field_len, len;
1N/A CK_RV rc;
1N/A
1N/A rc = ber_decode_PrivateKeyInfo(data, data_len, &alg,
1N/A &len, &rsa_priv_key);
1N/A if (rc != CKR_OK) {
1N/A return (rc);
1N/A }
1N/A if (memcmp(alg, ber_rsaEncryption, ber_rsaEncryptionLen) != 0) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A rc = ber_decode_SEQUENCE(rsa_priv_key, &buf, &buf_len, &field_len);
1N/A if (rc != CKR_OK)
1N/A return (rc);
1N/A offset = 0;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A if (offset > buf_len) {
1N/A return (CKR_FUNCTION_FAILED);
1N/A }
1N/A
1N/A offset = 0;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_MODULUS, tmp, len, &n_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_PUBLIC_EXPONENT, tmp, len, &e_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_PRIVATE_EXPONENT, tmp, len, &d_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_PRIME_1, tmp, len, &p_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_PRIME_2, tmp, len, &q_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_EXPONENT_1, tmp, len, &e1_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_EXPONENT_2, tmp, len, &e2_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += field_len;
1N/A }
1N/A
1N/A rc = ber_decode_INTEGER(buf + offset, &tmp, &len, &field_len);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A } else {
1N/A rc = build_attribute(CKA_COEFFICIENT, tmp, len, &coeff_attr);
1N/A if (rc != CKR_OK) {
1N/A goto cleanup;
1N/A }
1N/A offset += len;
1N/A }
1N/A
1N/A *modulus = n_attr;
1N/A *publ_exp = e_attr;
1N/A *priv_exp = d_attr;
1N/A *prime1 = p_attr;
1N/A *prime2 = q_attr;
1N/A *exponent1 = e1_attr;
1N/A *exponent2 = e2_attr;
1N/A *coeff = coeff_attr;
1N/A
1N/A return (CKR_OK);
1N/A
1N/Acleanup:
1N/A if (n_attr) free(n_attr);
1N/A if (e_attr) free(e_attr);
1N/A if (d_attr) free(d_attr);
1N/A if (p_attr) free(p_attr);
1N/A if (q_attr) free(q_attr);
1N/A if (e1_attr) free(e1_attr);
1N/A if (e2_attr) free(e2_attr);
1N/A if (coeff_attr) free(coeff_attr);
1N/A
1N/A return (rc);
1N/A}